AI Platform For Pixel Spacing, Distance, And Volumetric Predictions From Dental Images

ABSTRACT

A machine learning model is trained to predict pixel spacing, distance, and volumetric measurements. Training images are obtained by inpainting around an original image and scaling the inpainted image to obtain the training image having a different pixel spacing than the original image. The machine learning model may include an encoder, a transformer, a first TC layer, and a second TC layer. During training, loss may be obtained from a comparison of the output to the first TC layer to a coarse pixel spacing matrix and a comparison of the output of the second TC layer to a fine pixel spacing matrix. During utilization, the pixel spacing of an image may be obtained using the machine learning model and used to correct the image or measurements obtained from the image.

RELATED APPLICATIONS

This application is a continuation in part of U.S. application Ser. No. 16/875,922 filed May 15, 2020 and entitled ARTIFICIAL INTELLIGENCE ARCHITECTURE FOR IDENTIFICATION OF PERIODONTAL FEATURES.

This application is a continuation in part of U.S. application Ser. No. 16/880,938 filed May 21, 2020 and entitled AN ADVERSARIAL DEFENSE PLATFORM FOR AUTOMATED DENTAL IMAGE CLASSIFICATION.

This application is a continuation in part of U.S. application Ser. No. 16/880,942 filed May 21, 2020 and entitled PRIVACY PRESERVING ARTIFICIAL INTELLIGENCE SYSTEM FOR DENTAL DATA FROM DISPARATE SOURCES.

This application is a continuation in part of U.S. application Ser. No. 16/895,982 filed Jun. 8, 2020 and entitled SYSTEMS AND METHODS FOR DENTAL TREATMENT PREDICTION FROM CROSS-INSTITUTIONAL TIME-SERIES INFORMATION.

This application is a continuation in part of U.S. application Ser. No. 16/911,993 filed Jun. 25, 2020 and entitled SYSTEM AND METHODS FOR RESTORATIVE DENTISTRY TREATMENT PLANNING USING ADVERSARIAL LEARNING.

This application is a continuation in part of U.S. application Ser. No. 16/912,294 filed Jun. 25, 2020 and entitled SYSTEMS AND METHOD FOR ARTIFICIAL-INTELLIGENCE-BASED DENTAL IMAGE TO TEXT GENERATION.

This application is a continuation in part of U.S. application Ser. No. 16/912,412 filed Jun. 25, 2020 and entitled AUTOMATED DENTAL PATIENT IDENTIFICATION AND DUPLICATE CONTENT EXTRACTION USING ADVERSARIAL LEARNING.

This application is a continuation in part of U.S. application Ser. No. 16/900,726 filed Jun. 12, 2020 and entitled INPAINTING DENTAL IMAGES WITH MISSING DATA.

This application is a continuation in part of U.S. application Ser. No. 17/072,575 filed Oct. 16, 2020 and entitled ARTIFICIAL INTELLIGENCE SYSTEM FOR ORTHODONTIC MEASUREMENT, TREATMENT PLANNING, AND RISK ASSESSMENT.

This application is a continuation in part of U.S. application Ser. No. 17/033,277 filed Sep. 25, 2020 and entitled DENTAL IMAGE SYNTHESIS USING GENERATIVE ADVERSARIAL NETWORKS WITH SEMANTIC ACTIVATION BLOCKS.

This application is a continuation in part of U.S. application Ser. No. 17/033,411 filed Sep. 25, 2020 and entitled A GENERATIVE ADVERSARIAL NETWORK FOR DENTAL IMAGE SUPER-RESOLUTION, IMAGE SHARPENING, AND DENOISING.

This application is a continuation in part of U.S. application Ser. No. 17/124,147 filed Dec. 16, 2020 and entitled ARTIFICIAL INTELLIGENCE SYSTEM FOR AUTOMATED EXTRACTION AND PROCESSING OF DENTAL CLAIM FORMS.

This application is a continuation in part of U.S. application Ser. No. 17/214,440 filed Mar. 26, 2021 and entitled INTERFACE FOR GENERATING WORKFLOWS OPERATING ON PROCESSING DENTAL INFORMATION FROM ARTIFICIAL INTELLIGENCE.

FIELD OF THE INVENTION

This invention relates to automating the analysis of dental images.

BACKGROUND

The field of dentistry relates to a broad range of oral healthcare, which are often discretized into several sub-fields such as disease of the bone (periodontitis), disease of the tooth (caries), or bone and tooth alignment (orthodontics). Although these sub-fields are unique and clinicians undergo special training to specialize in these sub-fields, they share some commonalities. Although different image modalities are favored in sub-fields more than others, all sub-fields utilize similar imaging strategies such as full mouth series (FMX), cone-beam computed tomography (CBCT), cephalometric, panoramic, and intra-oral images. All sub-fields of dentistry use images for assessment of patient orientation, anatomy, comorbidities, past medical treatment, age, patient identification, treatment appropriateness, and time series information.

Diagnosis of disease in the dental field is performed by visual inspection of dental anatomy and features and by analysis of images obtained by X-ray or other imaging modality. There have been some attempts made to automate this process.

BRIEF DESCRIPTION OF THE FIGURES

In order that the advantages of the invention will be readily understood, a more particular description of the invention briefly described above will be rendered by reference to specific embodiments illustrated in the appended drawings. Understanding that these drawings depict only typical embodiments of the invention and are not therefore to be considered limiting of its scope, the invention will be described and explained with additional specificity and detail through use of the accompanying drawings, in which:

FIG. 1 is a process flow diagram of a method for classifying treatment in accordance with an embodiment of the present invention;

FIG. 2 is a process flow diagram of a hierarchy for classifying a treatment;

FIG. 3 is a schematic block diagram of a system for identifying image orientation in accordance with an embodiment of the present invention;

FIG. 4 is a schematic block diagram of a system for classifying images of a full mouth series in accordance with an embodiment of the present invention;

FIG. 5 is a schematic block diagram of a system for removing image contamination in accordance with an embodiment of the present invention;

FIG. 6A is a schematic block diagram of system for performing image domain transfer in accordance with an embodiment of the present invention;

FIG. 6B is a schematic block diagram of a cyclic GAN for performing image domain transfer in accordance with an embodiment of the present invention;

FIG. 7 is a schematic block diagram of a system for labeling teeth in an image in accordance with an embodiment of the present invention;

FIG. 8 is a schematic block diagram of a system for labeling periodontal features in an image in accordance with an embodiment of the present invention;

FIG. 9 is a schematic block diagram of a system for determining clinical attachment level (CAL) in accordance with an embodiment of the present invention;

FIG. 10 is a schematic block diagram of a system for determining pocket depth (PD) in accordance with an embodiment of the present invention;

FIG. 11 is a schematic block diagram of a system for determining a periodontal diagnosis in accordance with an embodiment of the present invention;

FIG. 12 is a schematic block diagram of a system for restoring missing data in images in accordance with an embodiment of the present invention;

FIG. 13 is a schematic block diagram of a system for detecting adversarial images in accordance with an embodiment of the present invention;

FIG. 14A is a schematic block diagram of a system for protecting a machine learning model from adversarial images in accordance with an embodiment of the present invention;

FIG. 14B is a schematic block diagram of a system for training a machine learning model to be robust against attacks using adversarial images in accordance with an embodiment of the present invention;

FIG. 14C is a schematic block diagram of a system for protecting a machine learning model from adversarial images in accordance with an embodiment of the present invention;

FIG. 14D is a schematic block diagram of a system for modifying adversarial images to protect a machine learning model from corrupted images in accordance with an embodiment of the present invention;

FIG. 14E is a schematic block diagram of a system for dynamically modifying a machine learning model to protect it from adversarial images in accordance with an embodiment of the present invention;

FIG. 15 is a schematic block diagram illustrating the training of a machine learning model at a plurality of disparate institutions in accordance with an embodiment of the present invention;

FIG. 16 is a process flow diagram of a method for generating a combined static model from a plurality of disparate institutions in accordance with an embodiment of the present invention;

FIG. 17 is a schematic block diagram illustrating the training of a combined static model by a plurality of disparate institutions in accordance with an embodiment of the present invention;

FIG. 18 is a process flow diagram of a method for training a moving base model for a plurality of disparate institutions in accordance with an embodiment of the present invention;

FIG. 19 is a schematic block diagram of a system for combing gradients from a plurality of disparate institutions;

FIG. 20 is a schematic block diagram illustrating dental anatomy;

FIG. 21 is a schematic block diagram of a system for identifying perturbations to anatomy labels in accordance with an embodiment of the present invention;

FIG. 22 is a schematic block diagram of another system for identifying perturbations to anatomy labels in accordance with an embodiment of the present invention;

FIG. 23 is a schematic block diagram of a system for identifying caries based on anatomy labeling style in accordance with an embodiment of the present invention;

FIG. 24 is a schematic block diagram of a system for detecting defects in a restoration in accordance with an embodiment of the present invention;

FIG. 25 is a schematic block diagram of a system for selecting a restoration for a tooth in accordance with an embodiment of the present invention;

FIG. 26 is a schematic block diagram of a system for identifying surfaces of a tooth having caries in accordance with an embodiment of the present invention;

FIG. 27 is a schematic block diagram of a system for selecting dental treatments in accordance with an embodiment of the present invention;

FIG. 28 is a schematic block diagram of a system for selecting a diagnosis, treatment, or patient match in accordance with an embodiment of the present invention;

FIG. 29 is a schematic block diagram of a system for predicting claim adjudication in accordance with an embodiment of the present invention;

FIG. 30 is a schematic block diagram of a system for predicting a treatment being appropriate based on past treatment in accordance with an embodiment of the present invention;

FIG. 31 is a schematic block diagram of a system for converting an image to a text sequence in accordance with an embodiment of the present invention;

FIGS. 32A through 32D illustrate approaches for generating vectors characterizing images for comparison in accordance with an embodiment of the present invention;

FIG. 33 is a schematic block diagram of an alternative system for characterizing images for comparison in accordance with an embodiment of the present invention;

FIG. 34 is a schematic block diagram of a system for generating synthetic dental images in accordance with an embodiment of the present invention;

FIG. 35 is a schematic block diagram of a system for performing anatomy-aware normalization in accordance with an embodiment of the present invention;

FIG. 36 is an example interface for generating mask for use in generating synthetic dental images in accordance with an embodiment of the present invention;

FIG. 37A is a process flow diagram of a method for generating shapes for adding to synthetic images in accordance with an embodiment of the present invention;

FIGS. 37B to 37D are diagrams illustrating processing of input shapes in accordance with an embodiment of the present invention;

FIG. 38A is a schematic block diagram of a system for generating images with increased resolution in accordance with an embodiment of the present invention;

FIG. 38B is a schematic block diagram of a system for generating images with increased sharpness in accordance with an embodiment of the present invention;

FIG. 39A is a schematic block diagram of a system for identifying orthodontic points in accordance with an embodiment of the present invention;

FIG. 39B is a diagram showing orthodontic points on dental anatomy;

FIG. 40 is a schematic block diagram of a system for measuring distances between orthodontic points in accordance with an embodiment of the present invention;

FIG. 41 is a schematic block diagram of a system for assessing orthodontic risk in accordance with an embodiment of the present invention;

FIG. 42A is a schematic block diagram of a system for generating a deformation. vector field in accordance with an embodiment of the present invention;

FIG. 42B is a diagram showing a deformation vector field;

FIG. 43 is a schematic block diagram of a system for generating a point-specific deformation vector field in accordance with an embodiment of the present invention;

FIG. 44 is a schematic block diagram of a system for generating an orthodontic treatment plan in accordance with an embodiment of the present invention;

FIG. 45 is a diagram of a dental form for processing according to the systems and methods disclosed herein;

FIG. 46 is a diagram illustrating identifying points in a dental form and transformations for aligning the dental form in accordance with an embodiment of the present invention;

FIG. 47 is a schematic block diagram of a system for identifying points in a dental form in accordance with an embodiment of the present invention;

FIG. 48 is a schematic block diagram of a system for identifying blobs of text in a dental form in accordance with an embodiment of the present invention;

FIG. 49A is a schematic block diagram of a system for obtaining text from a text blob of a dental form in accordance with an embodiment of the present invention;

FIG. 49B is a schematic block diagram of a system for obtaining text from a text blob of a dental form in accordance with an embodiment of the present invention;

FIG. 50 is a schematic block diagram of a system for obtaining text from multiple fields of a dental form in accordance with an embodiment of the present invention;

FIG. 51 is a schematic bloc k diagram of a system for obtaining provider identification information in accordance with an embodiment of the present invention;

FIG. 52 is a schematic block diagram of a system for processing provider identification information in accordance with an embodiment of the present invention;

FIG. 53 is a schematic block diagram of a system for correcting errors in provider identification information in accordance with an embodiment of the present invention;

FIG. 54 is a schematic block diagram of an interface for generating workflows for making automated treatment decisions in accordance with an embodiment of the present invention;

FIG. 55 is a schematic block diagram of an interface for creating blocks for use in workflows in accordance with an embodiment of the present invention;

FIG. 56 is a process flow diagram of a method for creating blocks in accordance with an embodiment of the present invention;

FIG. 57 is a process flow diagram of a method for creating workflows from blocks in accordance with an embodiment of the present invention;

FIG. 58 is a schematic block diagram illustrating an approach for generating training images for training a machine learning model to perform pixel spacing estimation;

FIG. 59 is a schematic block diagram of a machine learning model for performing pixel spacing estimation;

FIGS. 60A and 60B are schematic block diagrams of approaches for correcting dental measurements using pixel spacing estimations in accordance with an embodiment of the present invention; and

FIG. 61 is a schematic block diagram of an approach for relating pixel measurements to three-dimensional measurements in accordance with an embodiment of the present invention; and

FIG. 62 is a schematic block diagram of a computer system suitable for implementing methods in accordance with embodiments of the present invention.

DETAILED DESCRIPTION

It will be readily understood that the components of the invention, as generally described and illustrated in the Figures herein, could be arranged and designed in a wide variety of different configurations. Thus, the following more detailed description of the embodiments of the invention, as represented in the Figures, is not intended to limit the scope of the invention, as claimed, but is merely representative of certain examples of presently contemplated embodiments in accordance with the invention. The presently described embodiments will be best understood by reference to the drawings, wherein like parts are designated by like numerals throughout.

Embodiments in accordance with the invention may be embodied as an apparatus, method, or computer program product. Accordingly, the invention may take the form of an entirely hardware embodiment, an entirely software embodiment (including firmware, resident software, micro-code, etc.), or an embodiment combining software and hardware aspects that may all generally be referred to herein as a “module” or “system.” Furthermore, the invention may take the form of a computer program product embodied in any tangible medium of expression having computer-usable program code embodied in the medium.

Any combination of one or more computer-usable or computer-readable media may be utilized. For example, a computer-readable medium may include one or more of a portable computer diskette, a hard disk, a random access memory (RAM) device, a read-only memory (ROM) device, an erasable programmable read-only memory (EPROM or Flash memory) device, a portable compact disc read-only memory (CDROM), an optical storage device, and a magnetic storage device. In selected embodiments, a computer-readable medium may comprise any non-transitory medium that can contain, store, communicate, propagate, or transport the program for use by or in connection with the instruction execution system, apparatus, or device.

Computer program code for carrying out operations of the invention may be written in any combination of one or more programming languages, including an object-oriented programming language such as Java, Smalltalk, C++, or the like and conventional procedural programming languages, such as the “C” programming language or similar programming languages, and may also use descriptive or markup languages such as HTML, XML, JSON, and the like. The program code may execute entirely on a computer system as a stand-alone software package, on a stand-alone hardware unit, partly on a remote computer spaced some distance from the computer, or entirely on a remote computer or server. In the latter scenario, the remote computer may be connected to the computer through any type of network, including a local area network (LAN) or a wide area network (WAN), or the connection may be made to an external computer (for example, through the Internet using an Internet Service Provider).

The invention is described below with reference to flowchart illustrations and/or block diagrams of methods, apparatus (systems) and computer program products according to embodiments of the invention. It will be understood that each block of the flowchart illustrations and/or block diagrams, and combinations of blocks in the flowchart illustrations and/or block diagrams, can be implemented by computer program instructions or code. These computer program instructions may be provided to a processor of a general purpose computer, special purpose computer, or other programmable data processing apparatus to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing apparatus, create means for implementing the functions/acts specified in the flowchart and/or block diagram block or blocks.

These computer program instructions may also be stored in a non-transitory computer-readable medium that can direct a computer or other programmable data processing apparatus to function in a particular manner, such that the instructions stored in the computer-readable medium produce an article of manufacture including instruction means which implement the function/act specified in the flowchart and/or block diagram block or blocks.

The computer program instructions may also be loaded onto a computer or other programmable data processing apparatus to cause a series of operational steps to be performed on the computer or other programmable apparatus to produce a computer implemented process such that the instructions which execute on the computer or other programmable apparatus provide processes for implementing the functions/acts specified in the flowchart and/or block diagram block or blocks.

Referring to FIG. 1, a method 100 may be performed by a computer system in order to select an outcome for a set of input data. The outcome may be a determination whether a particular course of treatment is correct or incorrect. The method 100 may include receiving 102 an image. The image may be an image of patient anatomy indicating the periodontal condition of the patient. Accordingly, the image may be of a of a patient's mouth obtained by means of an X-ray (intra-oral or extra-oral, full mouth series (FMX), panoramic, cephalometric), computed tomography (CT) scan, cone-beam computed tomography (CBCT) scan, intra-oral image capture using an optical camera, magnetic resonance imaging (MRI), or other imaging modality.

The method 100 may further include receiving 104 patient demographic data, such as age, gender, underlying health conditions (diabetes, heart disease, cancer, etc.). The method 100 may further include receiving 106 a patient treatment history. This may include a digital representation of periodontal treatments the patient has received, such as cleanings, periodontal scaling, root planing, fillings, root canals, orthodontia, oral surgery, or other treatments or procedures performed on the teeth, gums, mouth, or jaw of the patient.

The method 100 may include pre-processing 108 the image received at step 102. Note that in some embodiments, the image received is correctly oriented, obtained using a desired imaging modality, and free of contamination or defects such that pre-processing is not performed. In other embodiments, some or all of re-orienting, removing contamination (e.g., noise), transforming to a different imaging modality, and correcting for other defects may be performed at step 108. In some embodiments, step 108 may correct for distortion due to foreshortening, elongation, metal artifacts, and image noise due to poor image acquisition from hardware, software, or patient setup.

Step 108 may further include classifying the image, such as classifying which portion of the patient's teeth and jaw is in the field of view of the image. For example, a full-mouth series (FMX) typically includes images classified as Premolar2, Molar3, Anterior1, Anterior2, Anterior3 and their respective corresponding locations such as Jaw Region, Maxilla, and Mandible. For each of these, the view may be classified as being the left side or right side of the patients face.

In the following description reference to an “image” shall be understood to interchangeably reference either the original image from step 102 or an image resulting from the pre-processing of step 108.

The method 100 may further include processing 110 the image to identify patient anatomy. Anatomy identified may be represented as a pixel mask identifying pixels of the image that correspond to the identified anatomy and labeled as corresponding to the identified anatomy. This may include identifying individual teeth. As known in the field of dentistry, each tooth is assigned a number. Accordingly, step 110 may include identifying teeth in the image and determining the number of each identified teeth. Step 110 may further include identifying other anatomical features for each identified tooth, such as its cementum-enamel junction (CEJ), boney points corresponding to periodontal disease around the tooth, gingival margin (GM), junctional epithelium (JE), or other features of the tooth that may be helpful in characterizing the health of the tooth and the gums and jaw around the tooth.

The method 100 may further include detecting 112 features present in the anatomy identified at step 110. This may include identifying caries, measuring clinical attachment level (CAL), measuring pocket depth (PD), or identifying other clinical conditions that may indicate the need for treatment. The identifying step may include generating a pixel mask defining pixels in the image corresponding to the detected feature. The method 100 may further include generating 114 a feature metric, i.e. a characterization of the feature. This may include performing a measurement based on the pixel mask from step 112. Step 114 may further take as inputs the image and anatomy identified from the image at step 110. For example, CAL or PD of teeth in an image may be measured, such as using the machine-learning approaches described below (see discussion of FIGS. 9 and 10)

The result of steps 108, 110, 112, and 114 is an image that may have been corrected, labels, e.g. pixel masks, indicating the location of anatomy and detected features and a measurement for each detected feature. This intermediate data may then be evaluated 116 with respect to a threshold. In particular, this may include an automated analysis of the detected and measured features with respect to thresholds. For example, CAL or PD measured using the machine-learning approaches described below may be compared to thresholds to see if treatment may be needed. Step 116 may also include evaluating some or all of the images, labels, detected features, and measurements for detected features a machine learning model to determine whether a diagnosis is appropriate (see FIG. 11).

If the result of step 116 is affirmative, then the method 100 may include processing 118 the feature metric from step 114 according to a decision hierarchy. The decision hierarchy may further operate with respect to patient demographic data from step 104 and the patient treatment history from step 106. The result of the processing according to the decision hierarchy may be evaluated at step 120. If the result is affirmative, than an affirmative response may be output 122. An affirmative response may indicate that the a course of treatment corresponding to the decision hierarchy is determined to be appropriate. If the result of processing 118 the decision hierarchy is negative, then the course of treatment corresponding to the decision hierarchy is determined not to be appropriate. The evaluation according to the method 100 may be performed before the fact, i.e. to determine whether to perform the course of treatment. The method 100 may also be performed after the fact, i.e. to determine whether a course of treatment that was already performed was appropriate and therefore should be paid for by insurance.

FIG. 2 illustrates a method 200 for evaluating a decision hierarchy, such as may be performed at step 118. The method 200 may be a decision hierarchy for determining whether scaling and root planing (SRP) should be performed for a patient. SRP is performed in response to the detection of pockets. Accordingly, the method 200 may be performed in response to detecting pockets at step 112 (e.g., pockets having a minimum depth, such as at least pocket having a depth of at least 5 mm) and determining that the size of these pockets as determined at step 114 meets a threshold condition at step 116, e.g. there being at least one pocket (or some other minimum number of pockets) having a depth above a minimum depth, e.g. 5 mm.

The method 200 may include evaluating 202 whether the treatment, SRP, has previously been administered within a threshold time period prior to a reference time that is either (a) the time of performance of the method 200 and (b) the time that the treatment was actually performed, i.e. the treatment for which the appropriateness is to be determined according to the method 100 and the method 200. For example, this may include whether SRP was performed within 24 months of the reference time.

If not, the method 200 may include evaluating 204 whether the patient is above a minimum age, such as 25 years old. If the patient is above the minimum age, the method 200 may include evaluating 206 whether the number of pockets having a depth exceeding a minimum pocket depth exceeds a minimum pocket number. For example, where the method 200 is performed to determine whether SRP is/was appropriate for a quadrant (upper left, upper right, lower left, lower right) of the patient's jaw, step 206 may include evaluating whether there are at least four teeth in that quadrant that collectively include at least 8 sites, each site including a pocket of at least 5 mm. Where the method 200 is performed to determine whether SRP is/was appropriate for an area that is less than an entire quadrant, step 206 may include evaluating whether there are one to three teeth that include at least 8 sites, each site including a pocket of at least 5 mm.

If the result of step 206 is positive, then an affirmative result is output, i.e. the course of treatment is deemed appropriate. If the result of step 206 is positive, then an affirmative result is output 208, i.e. the course of treatment is deemed appropriate. If the result of step 206 is negative, then a negative result is output 210, i.e. the course of treatment is deemed not to be appropriate.

If either of (a) SRP was found 202 to have been performed less than the time window from the reference time or (b) the patient is found 204 to be below the minimum age, the method 200 may include evaluating 212 whether a periodontal chart has been completed for the patient within a second time window from the reference time, e.g. six months. If the result of step 212 is positive, then processing may continue at step 206. If the result of step 212 is negative, then processing may continue at step 210.

The decision hierarchy of the method 200 is just one example. Decision hierarchies for other treatments may be evaluated according to the method 100, such as gingiovectomy; osseous mucogingival surgery; free tissue grafts; flap reflection or resection and debridement (with or without osseous recontouring); keratinized/attached gingiva preservation; alveolar bone reshaping; bone grafting (with or without use of regenerative substrates); guided tissue regeneration; alveolar bone reshaping following any of the previously-mentioned procedures; and tissue wedge removal for performing debridement, flap adaptation, and/or pocket depth reduction. Examples of decision hierarchies for these treatments are illustrated in the U.S. Provisional Application Ser. No. 62/848,905.

FIG. 3 is a schematic block diagram of a system 300 for identifying image orientation in accordance with an embodiment of the present invention. The illustrated system may be used to train a machine to determine image orientation as part of the pre-processing of step 108 of the method 100. In particular, once an image orientation is known, it may be rotated to a standard orientation for processing according to subsequent steps of the method 100.

As described below, machine learning models, such as a CNN, may be used to perform various tasks described above with respect to the method 100. Training of the CNN may be simplified by ensuring that the images used are in a standard orientation with respect to the anatomy represented in the images. When images are obtained in a clinical setting they are often mounted incorrectly by a human before being stored in a database. The illustrated system 300 may be used to determine the orientation of anatomy in an image such that they may be rotated to the standard orientation, if needed, prior to subsequent processing with another CNN or other machine learning model.

A training algorithm 302 takes as inputs training data entries that each include an image 304 according to any of the imaging modalities described herein and an orientation label 306 indicating the orientation of the image, e.g. 0 degrees, 90 degrees, 180 degrees, and 270 degrees. The orientation label 306 for an image may be assigned by a human observing the image and determining its orientation. For example, a licensed dentist may determine the label 306 for each image 304.

The training algorithm 302 may operate with respect to a loss function 308 and modify a machine learning model 310 in order to reduce the loss function 308 of the model 310. In this case, the loss function 308 may be a function that increases with a difference between the angle estimated by the model 310 for the orientation of an image 304 and the orientation label 306 of the image.

In the illustrated embodiment, the machine learning model 310 is a convolution neural network. For example, the machine learning model 310 may be an encoder-based densely-connected CNN with attention-gated skip connections and deep-supervision. In the illustrated embodiment, the CNN includes six multi-scale stages 312 followed by a fully connected layer 314, the output 316 of the fully connected layer 314 being an orientation prediction (e.g. 0 degrees, 90 degrees, 180 degrees, or 270 degrees).

In some embodiment, each multi-scale stage 312 may contain three 3×3 convolutional layers, which may be paired with batch-normalization and leaky rectified linear units (LeakyReLU). The first and last convolutional layers of each stage 312 may be concatenated via dense connections which help reduce redundancy within the CNN by propagating shallow information to deeper parts of the CNN.

Each multi-scale network stage 312 may be downscaled by a factor of two at the end of each multi-scale stage 312 by convolutional downsampling. The second and fourth multi-scale stages 312 may be passed through attention gates 318 a, 318 b before being concatenated with the last layer. For example, the gating signal of attention gate 318 a that is applied to the second stage 312 may be derived from the output of the fourth stage 312. The gating signal of attention gate 318 b that is applied to the fourth stage 312 may be derived from the output of the sixth stage 312. Not all regions of the image 304 are relevant for determining orientation, so the attention gates 318 a, 318 b may be used to selectively propagate semantically meaningful information to deeper parts of the CNN

In some embodiments, the input image 304 to the CNN is a raw 64×64 pixel image and the output 316 of the network is a likelihood score for each possible orientation. The loss function 308 may be trained with categorical cross entropy which considers each orientation to be an orthogonal category. Adam optimization may be used during training which automatically estimates the lower order moments and helps estimate the step size which desensitizes the training routine to the initial learning rate.

In at least one possible embodiment, the images 304 are 3D images, such as a CT scan. Accordingly, the 3×3 convolutional kernels of the multi-scale networks with 3×3×3 convolutional kernels. The output 316 of the CNN may therefore map to four rotational configurations 0, 90, 180, and 270 along the superior-inferior axis as well as one orthogonal orientation in the superior-inferior direction.

Because machine learning models may be sensitive to training parameters and architecture, for all machine learning models described herein, including the machine learning model 310, a first set of training data entries may be used for hyperparameter testing and a second set of training data entries not included in the first set may be used to assess model performance prior to utilization.

The training algorithm 302 for this CNN and other CNNs and machine learning models described herein may be implemented using PYTORCH. Training of this CNN and other CNNs and machine learning models described herein may be performed using a GPU, such as NVIDIA's TESLA GPUs coupled with INTEL XEON CPUs. Other machine learning tools and computational platforms may also be used.

Generating inferences using this machine learning model 310 and other machine learning models described herein may be performed using the same type of GPU used for training or some other type of GPU or other type of computational platform. In other embodiment, inferences using this machine learning model 310 or other machine learning models described herein may be generated by placing the machine learning model on an AMAZON web services (AWS) GPU instance. During deployment, a server may instantiate the machine learning model and preload the model architecture and associated weights into GPU memory. A FLASK server may then load an image buffer from a database, convert the image into a matrix, such as a 32-bit matrix, and load it onto the GPU. The GPU matrix may then be passed through the machine learning model in the GPU instance to obtain an inference, which may then be stored in a database. Where the machine learning model transforms an image or pixel mask, the transformed image or pixel mask may be stored in an image array buffer after processing of the image using the machine learning model. This transformed image or pixel mask may then be stored in the database as well.

In the case of the machine learning model 310 of FIG. 3, the transformed image may be an image rotated from the orientation determined according to the machine learning model 310 to the standard orientation. The machine learning model 310 may perform the transformation or this may be performed by a different machine learning model or process.

FIG. 4 is a schematic block diagram of a system 400 for determining the view of a full mouth series (FMX) that an image represents in accordance with an embodiment of the present invention. The illustrated architecture may be used to train a machine learning model to determine which view of the FMX an image corresponds to. The system 400 may be used to train a machine learning model to classify the view an image represents for use in pre-processing an image at step 108 of the method 100.

In dentistry, an FMX is often taken to gain comprehensive imagery of oral anatomy. Standard views are categorized by the anatomic region sequence indicating the anatomic region being viewed such as jaw region, maxilla, or mandible and an anatomic region modifier sequence indicating a particular sub-region being viewed such as premolar 2, molar 3, anterior 1, anterior 2, and anterior 3. In addition, each anatomic region sequence and anatomic region sequence modifier has a laterality indicting which side of the patient is being visualized, such as left (L), right (R), or ambiguous (A). Correct identification, diagnosis, and treatment of oral anatomy and pathology rely on accurate pairing of FMX mounting information of each image.

In some embodiment, the system 400 may be used to train a machine learning model to estimate the view of an image. Accordingly, the output of the machine learning model for a given input image will be a view label indicating an anatomic region sequence, anatomic region sequence modifier, and laterality visualized by the image. In some embodiments, the CNN architecture may include an encoder-based residually connected CNN with attention-gated skip connections and deep-supervision as described below.

In the system 400, A training algorithm 402 takes as inputs training data entries that each include an image 404 according to any of the imaging modalities described herein and a view label 406 indicating which of the view the image corresponds to (anatomic region sequence, anatomic region sequence modifier, and laterality). The view label 406 for an image may be assigned by a human observing the image and determining which of the image views it is. For example, a licensed dentist may determine the label 406 for each image 404.

The training algorithm 402 may operate with respect to a loss function 408 and modify a machine learning model 410 in order to reduce the loss function 408 of the model 410. In this case, the loss function 408 may be a function that is zero when a view label output by the model 410 for an image 406 matches the view label 406 for that image 404 and is non-zero, e.g. 1, when the view label output does not match the view label 406. Inasmuch as there are three parts to each label (anatomic region sequence, anatomic region modifier sequence, and laterality) there may be three loss functions 408, one for each part that is zero when the estimate for that part is correct and non-zero, e.g. 1, when the estimate for that part is incorrect. Alternatively, the loss function 408 may output a single value decreases with the number of parts of the label that are correct and increase with the number of parts of the label that are incorrect

The training algorithm 402 may train a machine learning model 410 embodied as a CNN. In the illustrated embodiment, the CNN includes seven multi-scale stages 312 followed by a fully connected layer 414 that outputs an estimate for the anatomic region sequence, anatomic region modifier sequence, and laterality of an input image 404. Each multi-scale stage 412 may contain three 3×3 convolutional layers that may be paired with batchnormalization and leaky rectified linear units (LeakyReLU). The first and last convolutional layers of a stage 412 may be concatenated via residual connections which help reduce redundancy within the network by propagating shallow information to deeper parts of the network.

Each multi-scale stage 412 may be downscaled by a factor of two at the end of each multi-scale stage 412, such as by max pooling. The third and fifth multi-scale stages 412 may be passed through attention gates 418 a, 418 b, respectively, before being concatenated with the output of the last stage 412. For example, the gating signal of attention gate 418 a that is applied to the output of the third stage 412 may be derived from the fifth stage 412 and the gating signal applied by attention gate 418 b to the output of the fifth stage 412 may be derived from the seventh stage 412. Not all regions of the image are relevant for classification, so attention gates 418 a, 418 b may be used to selectively propagate semantically meaningful information to deeper parts of the network.

The input images 404 may be raw 128×128 images, which may be rotated to a standard orientation according to the approach of FIG. 3. The output 416 of the machine learning model 410 may be a likelihood score for each of the anatomic region sequence, anatomic region modifier sequence, and laterality of the input image 404. The loss function 408 may be trained with categorical cross entropy, which considers each part of a label (anatomic region sequence, anatomic region modifier sequence, and laterality) to be an orthogonal category. Adam optimization may be used during training, which automatically estimates the lower order moments and helps estimate the step size which desensitizes the training routine to the initial learning rate.

In at least one possible embodiment, the images 404 are 3D images, such as a CT scan. Accordingly, the 3×3 convolutional kernels of the multi-scale stages 412 may be replaced with 3×3×3 convolutional kernels. The output of the machine learning model 410 in such embodiments may be a mapping of the CT scan to one of a number of regions within the oral cavity, such as the upper right quadrant, upper left quadrant, lower left quadrant, and lower right quadrant.

The training algorithm 402 and utilization of the trained machine learning model 410 may be implemented using PYTORCH and AWS GPU instances in the same manner as described above with respect to FIG. 3.

FIG. 5 is a schematic block diagram of a system 500 for removing image contamination in accordance with an embodiment of the present invention. The system 500 may be used to train a machine learning model to remove contamination from images for use in pre-processing an image at step 108 of the method 100. In some embodiment, contamination may be removed from an image using the approach of FIG. 5 to obtain a corrected image and the corrected image may then be reoriented using the approach of FIG. 3 to obtain a reoriented image (though the image output from the approach of FIG. 3 may not always be rotated relative to the input image). The reoriented image may then be used to classifying the FMX view of the image using the approach of FIG. 4.

In some embodiment, the system 500 may be used to train a machine learning model to output an improved quality image for a given input image. In order to establish the correct diagnosis from dental images, it is often useful to have high resolution, high contrast, and artifact free images. It can be difficult to properly delineate dental anatomy if image degradation has occurred due to improper image acquisition, faulty hardware, patient setup error, or inadequate software. Poor image quality can take many forms such as noise contamination, poor contrast, or low resolution. The illustrated system 500 may be used to solve this problem.

In the system 500, A training algorithm 502 takes as inputs contaminated images 504 and real images 506. As for other embodiments, the images 504, 506 may be according to any of the imaging modalities described herein. The images 504 and 506 are unpaired in some embodiments, meaning the real images 506 are not uncontaminated versions of the contaminated images 504. Instead, the real images 506 may be selected from a repository of images and used to assess the realism of synthetic images generated using the system 500. The contaminated images 504 may be obtained by adding contamination to real images in the form of noise, distortion, or other defects. The training algorithm 502 may operate with respect to one or more loss functions 508 and modify a machine learning model 510 in order to reduce the loss functions 508 of the model 510.

In the illustrated embodiment, the machine learning model 510 may be embodied as a generative adversarial network (GAN) including a generator 512 and a discriminator 514. The generator 512 may be embodied as an encoder-decoder generator including seven multi-scale stages 516 in the encoder and seven multi-scale stages 518 in the decoder (the last stage 516 of the encoder being the first stage of the decoder). The discriminator 514 may include five multi-scale stages 522.

Each multi-scale stage 516, 518 within the generator 512 may use 4×4 convolutions paired with batchnormalization and rectified linear unit (ReLU) activations. Convolutional downsampling may be used to downsample each multi-scale stage 516 and transpose convolutions may be used between the multi-scale stages 518 to incrementally restore the original resolution of the input signal. The resulting high-resolution output channels of the generator 512 may be passed through a 1×1 convolutional layer and hyperbolic tangent activation function to produce a synthetic image 520. At each iteration, the synthetic image 520 and a real image 506 from a repository of images may be passed through the discriminator 514.

The discriminator 514 produces as an output 524 a realism matrix that is an attempt to differentiate between real and fake images. The realism matrix is a matrix of values, each value being an estimate as to which of the two input images is real. The loss function 508 may then operate on an aggregation of the values in the realism matrix, e.g. average of the values, a most frequently occurring value of the values, or some other function. The closer the aggregation is to the correct conclusion (determining that the synthetic image 520 is fake), the lower the output of the loss function 508. The realism matrix may be preferred over a conventional single output signal discriminator because it is better suited to capture local image style characteristics and it is easier to train.

In some embodiments, the loss functions 508 utilize level 1 (L1) loss to help maintain the spatial congruence of the synthetic image 520 and real image 506 and adversarial loss to encourage realism. The generator 512 and discriminator 514 may be trained simultaneously until the discriminator 514 can no longer differentiate between synthetic and real images or a Nash equilibrium has been reached.

In at least one possible embodiment, the system 500 may operate on three-dimensional images 504, 506, such as a CT scan. This may include replacing the 4×4 convolutional kernels with 4×4×4 convolutional kernels and replacing the 1×1 convolutional kernels with 1×1×1 convolutional kernels.

The training algorithm 502 and utilization of the trained machine learning model 510 may be implemented using PYTORCH and AWS GPU instances in the same manner as described above with respect to FIG. 3.

FIG. 6A is a schematic block diagram of system 600 for performing image domain transfer in accordance with an embodiment of the present invention. FIG. 6B is a schematic block diagram of cyclic GAN for use with the system 600.

The system 600 may be used to train a machine learning model 610, e.g. a cyclic GAN, to transform an image obtained using one image modality to an image from another image modality. Examples of transforming between two-dimensional imaging modalities may include transforming between any two of the following: an X-ray, CBCT image, a slice of a CT scan, an intra-oral photograph, cephalometric, panoramic, or other two-dimensional imaging modality. In some embodiments, the machine learning model 610 may transform between any two of the following three-dimensional imaging modalities, such as a CT scan, magnetic resonance imaging (MRI) image, a three-dimensional optical image, LIDAR (light detection and ranging) point cloud, or other three-dimensional imaging modality. In some embodiments, the machine learning model 610 may be trained to transform between any one of the two-dimensional imaging modalities and any one of the three-dimensional imaging modalities. In some embodiments, the machine learning model 610 may be trained to transform between any one of the three-dimensional imaging modalities and any one of the two-dimensional imaging modalities.

In some embodiments, the machine learning model 610 may be trained to translate between a first imaging modality that is subject to distortion (e.g., foreshortening or other type of optical distortion and a second imaging modality that is less subject to distortion. Deciphering dental pathologies on an image may be facilitated by establishing absolute measurements between anatomical landmarks (e.g., in a standard units of measurement, such as mm). Two-dimensional dental images interpret a three-dimensional space by estimating x-ray attenuation along a path from the target of an x-ray source to a photosensitive area of film or detector array. The relative size and corresponding lengths of any intercepting anatomy will be skewed as a function of their position relative to the x-ray source and imager. Furthermore, intra-oral optical dental images capture visual content by passively allowing scattered light to intercept a photosensitive detector array. Objects located further away from the detector array will appear smaller than closer objects, which makes estimating absolute distances difficult. Correcting for spatial distortion and image contamination can make deciphering dental pathologies and anatomy on x-ray, optical, or CBCT images more accurate. The machine learning model 610 may therefore be trained to translate between a distorted source domain and an undistorted target domain using unpaired dental images.

The transformation using the machine learning model 610 may be performed on an image that has been reoriented using the approach of FIG. 3 and/or had contamination removed using the approach of FIG. 5. Transformation using the machine learning model 610 may be performed to obtain a transformed image and the transformed image may then be used for subsequent processing according to some or all of steps 110, 112, and 114 of the method 100. Transformation using the machine learning model 610 may be performed as part of the preprocessing of step 108 of the method 100.

In the system 600, A training algorithm 602 takes as inputs images 604 from a source domain (first imaging modality, e.g., a distorted image domain) and images 606 from a target domain (second imaging modality, e.g., a non-distorted image domain or domain that is less distorted than the first domain). The images 604 and 606 are unpaired in some embodiments, meaning the images 606 are not transformed versions of the images 504 or paired such that an image 604 has a corresponding image 606 visualizing the same patient's anatomy. Instead, the images 506 may be selected from a repository of images and used to assess the transformation of the images 604 using the machine learning model 610. The training algorithm 502 may operate with respect to one or more loss functions 608 and modify a machine learning model 610 in order to reduce the loss functions 608 of the model 610.

FIG. 6B illustrates the machine learning model 610 embodied as a cyclic GAN, such as a densely-connected cycle consistent cyclic GAN (D-GAN). The cyclic GAN may include a generator 612 paired with a discriminator 614 and a second generator 618 paired with a second discriminator 620. The generators 612, 618 may be implemented using any of the approaches described above with respect to the generator 512. Likewise, the discriminators 614, 620 may be implemented using any of the approaches described above with respect to the discriminator 514.

Training of the machine learning model 610 may be performed by the training algorithm 602 as follows:

(Step 1) An image 604 in the source domain is input to generator 612 to obtain a synthetic image 622 in the target domain.

(Step 2) The synthetic image 622 and an unpaired image 606 from the target domain are input to the discriminator 614, which produces a realism matrix output 616 that is the discriminator's estimate as to which of the images 622, 606 is real.

(Step 3) Loss functions LF1 and LF2 are evaluated. Loss function LF1 is low when the output 616 indicates that the synthetic image 622 is real and that the target domain image 606 is fake. Since the output 616 is a matrix, the loss function LF1 may be a function of the multiple values (average, most frequently occurring value, etc.). Loss function LF2 is low when the output 616 indicates that the synthetic image 622 is fake and that the target domain image 606 is real. Thus, the generator 612 is trained to “fool” the discriminator 614 and the discriminator 614 is trained to detect fake images. The generator 612 and discriminator 614 may be trained concurrently.

(Step 4) The synthetic image 622 is input to the generator 618. The generator 618 transforms the synthetic image 622 into a synthetic source domain image 624.

(Step 5) A loss function LF3 is evaluated according to a comparison of the synthetic source domain image 624 and the source domain image 604 that was input to the generator 612 at Step 1. The loss function LF3 decreases with similarity of the images 604, 622.

(Step 6) A real target domain image 606 (which may be the same as or different from that input to the discriminator 614 at Step 2, is input to the generator 618 to obtain another synthetic source domain image 624. This synthetic source domain image 624 is input to the discriminator 620 along with a source domain image 604, which may be the same as or different from the source domain image 604 input to the generator 612 at Step 1.

(Step 7) The output 626 of the discriminator 620, which may be a realism matrix, is evaluated with respect to a loss function LF4 and a loss function LF5. Loss function LF4 is low when the output 626 indicates that the synthetic image 624 is real and that the source domain image 604 is fake. Since the output 626 is a matrix, the loss function LF4 may be a function of the multiple values (average, most frequently occurring value, etc.). Loss function LF5 is low when the output 626 indicates that the synthetic image 624 is fake and that the source domain image 604 is real.

(Step 8) The synthetic image 624 obtained at Step 6 is input to the generator 612 to obtain another synthetic target domain image 622.

(Step 9) A loss function LF6 is evaluated according to a comparison of the synthetic target domain image 622 from Step 8 and the target domain image 606 that was input to the generator 618 at Step 6. The loss function LF6 decreases with similarity of the images 606, 622.

(Step 10) Model parameters of the generators 612, 618 and the discriminators 614, 620 are tuned according to the outputs of the loss functions LF1, LF2, LF3, LF4, LF5, LF6, and LF7.

Steps 1 through 10 may be repeated until an ending condition is reached, such as when the discriminators 616, 620 can no longer distinguish between synthetic and real images (e.g., only correct 50 percent of the time), a Nash equilibrium is reached, or some other ending condition is reached.

Since the machine learning model 610 trains on un-paired images, a conventional L1 loss may be inadequate because the source and target domains are not spatially aligned. To promote spatial congruence between the source input image 604 and synthetic target image 622, the illustrated reverse GAN network (generator 618 and discriminator 620) may be used in combination with the illustrated forward GAN network (generator 612 and discriminator 614). Spatial congruence is therefore encouraged by evaluating L1 loss (loss function LF3) at Step 5 and evaluating L1 loss (loss function LF6) at Step 9.

Once training is ended, the generator 612 may be used to transform an input image in the source domain to obtain a transformed image in the target domain. The discriminators 616, 620 and the second generator 618 may be ignored or discarded during utilization.

The training algorithm 602 and utilization of the trained machine learning model 610 may be implemented using PYTORCH and AWS GPU instances in the same manner as described above with respect to FIG. 3.

In at least one possible embodiment, the system 600 operates on three-dimensional images, such as a CT, by replacing two-dimensional convolutional kernels (e.g., 4×4 and 1×1) with three-dimensional convolution kernels (e.g., 4×4×4 or 1×1×1).

FIG. 7 is a schematic block diagram of system 700 for labeling teeth in accordance with an embodiment of the present invention. In order to establish the correct diagnosis and treatment protocol from dental images, it is often useful to first identify tooth labels. It can be challenging to correctly label teeth on abnormal anatomy because teeth might have caries, restorations, implants, or other characteristics that might hamper tooth identification. Furthermore, teeth might migrate and cause gaps between adjacent teeth or move to occupy gaps that resulted from extractions. The illustrated system 700 may utilizes adversarial loss and individual tooth level loss to label teeth in an image.

In the system 700, A training algorithm 702 takes as inputs training data entries that each include an image 704 and labels 706 a for teeth represented in that image. For example, the labels 706 a may be a tooth label mask in which pixel positions of the image 704 that correspond to a tooth are labeled as such, e.g. with the tooth number of a labeled tooth. The labels 706 a for an image may be generated by a licensed dentist. The training algorithm 702 may further make use of unpaired labels 706 b, i.e., pixels masks for images of real teeth, such as might be generated by a licensed dentist that do not correspond to the images 704 or labels 706 a.

The training algorithm 702 may operate with respect to one or more loss functions 708 and modify a machine learning model 710 in order to train the machine learning model 710 to label teeth in a given input image. The labeling performed using the machine learning model 710 may be performed on an image that has been reoriented using the approach of FIG. 3 and had contamination removed using the approach of FIG. 5. In some embodiments, a machine learning model 710 may be trained for each view of the FMX such that the machine learning model 710 is used to label teeth in an image that has previously been classified using the approach of FIG. 4 as belonging to the FMX view for which the machine learning model 710 was trained.

In the illustrated embodiment, the machine learning model 710 includes a GAN including a generator 712 and a discriminator 714. The discriminator 714 may have an output 716 embodied as a realism matrix that may be implemented as for other realism matrices in other embodiments as described above. The output of the generator 712 may also be input to a classifier 718 trained to produce an output 720 embodied as a tooth label, e.g. pixel mask labeling a portion of an input image estimated to include a tooth.

As for other GAN disclosed herein, the generator 712 may include seven multi-scale stage deep encoder-decoder generator, such as using the approach described above with respect to the generator 512. For the machine learning model 710, the output channels of the generator 712 may be passed through a 1×1 convolutional layer as for the generator 512. However, the 1×1 convolution layer may further include a sigmoidal activation function to produce tooth labels. The generator 712 may likewise have stages of a different size than the generator 512, e.g., an input stage of 256×256 with downsampling by a factor of two between stages.

The discriminator 714 may be implemented using the approach described above for the discriminator 514. However, in the illustrated embodiment, the discriminator 514 includes four layers, though five layers as for the discriminator 514 may also be used.

The classifier 718 may be embodied as an encoder including six multi-scale stages 722 coupled to a fully connected layer 724, the output 720 of the fully connected layer 314 being a tooth label mask. In some embodiments, each multi-scale stage 722 may contain three 3×3 convolutional layers, which may be paired with batch-normalization and leaky rectified linear units (LeakyReLU). The first and last convolutional layers of each stage 722 may be concatenated via dense connections which help reduce redundancy within the CNN by propagating shallow information to deeper parts of the CNN. Each multi-scale network stage 722 may be downscaled by a factor of two at the end of each multi-scale stage 722 by convolutional downsampling.

Training of the machine learning model 710 may be performed by the training algorithm 702 according to the following method:

(Step 1) An image 704 is input to the generator 712, which outputs synthetic labels 726 for the teeth in the image 704. The synthetic labels 726 and unpaired tooth labels 706 b from a repository are input to the discriminator 714. The discriminator 714 outputs a realism matrix with each value in the matrix being an estimate as to which of the input labels 726, 706 b is real.

(Step 2) Input data 728 is input to the classifier 718, the input data 728 including layers including the original image 704 concatenated with the synthetic label 726 from Step 1. In response, the classifier 718 outputs its own synthetic label on its output 720.

(Step 3) The loss functions 708 are evaluated. This may include a loss function LF1 based on the realism matrix output at Step 1 such that the output of LF1 decreases with increase in the number of values of the realism matrix that indicate that the synthetic labels 726 are real. Step 3 may also include evaluating a loss function LF2 based on the realism matrix such that the output of LF2 decreases with increase in the number of values of the realism matrix that indicate that the synthetic labels 726 are fake. Step 3 may include evaluating a loss function LF3 based on a comparison of the synthetic label output by the classifier 718 and the tooth label 706 a paired with the image 704 processed at Step 1. In particular, the output of the loss function LF3 may decrease with increasing similarity of the synthetic label output from the classifier 718 and the tooth label 706 a.

(Step 4) The training algorithm 702 may use the output of loss function LF1 to tune parameters of the generator 712, the output of loss function LF2 to tune parameters of the discriminator 714, and the output of the loss function LF3 to tune parameters of the classifier 718. In some embodiments, the loss functions 708 are implemented as an objective function that utilizes a combination of softdice loss between the synthetic tooth label 726 and the paired truth tooth label 706 a, adversarial loss from the discriminator 714, and categorical cross entropy loss from the classifier 718.

Steps 1 through 4 may be repeated such that the generator 712, discriminator 714, and classifier 718 are trained simultaneously. Steps 1 through 4 may continue to be repeated until an end condition is reached, such as until loss function LF3 meets a minimum value or other ending condition and LF2 is such that the discriminator 714 identifies the synthetic labels 726 as real 50 percent of the time or Nash equilibrium is reached.

During utilization, the discriminator 716 may be ignored or discarded. Images may then be processed by the generator 712 to obtain a synthetic label 726, which is then concatenated with the image to obtain data 728, which is then processed by the classifier 718 to obtain one or more tooth labels.

The training algorithm 702 and utilization of the trained machine learning model 710 may be implemented using PYTORCH and AWS GPU instances in the same manner as described above with respect to FIG. 3.

In at least one possible embodiment, the system 700 operates on three-dimensional images, such as a CT, by replacing two-dimensional convolutional kernels (e.g., 4×4 and 1×1) with three-dimensional convolution kernels (e.g., 4×4×4 or 1×1×1).

FIG. 8 is a schematic block diagram of system 800 for labeling features of teeth and surrounding areas in accordance with an embodiment of the present invention. For example, the system 800 may be used to label anatomical features such as the cementum enamel junction (CEJ), bony points on the maxilla or mandible that are relevant to the diagnosis of periodontal disease, gingival margin, junctional epithelium, or other anatomical feature.

In the system 800, A training algorithm 802 takes as inputs training data entries that each include an image 804 a and labels 804 b for teeth represented in that image, e.g., pixel masks indicating portions of the image 804 a corresponding to teeth. The labels 804 b for an image 804 a may be generated by a licensed dentist or automatically generated using the tooth labeling system 700 of FIG. 7. Each training data entry may further include a feature label 806 that may be embodied as a pixel mask indicating pixels in the image 804 a that correspond to an anatomical feature of interest. The image 804 a may be an image that has been reoriented according to the approach of FIG. 3 and/or has had contamination removed using the approach of FIG. 4. In some embodiments, a machine learning model 810 may be trained for each view of the FMX such that the machine learning model 810 is used to label teeth in an image that has previously been classified using the approach of FIG. 4 as belonging to the FMX view for which the machine learning model 810 was trained.

As described below, two versions of the feature label 806 may be used. An non-dilated version is used in which only pixels identified as corresponding to the anatomical feature of interest are labeled. A dilated version is also used in which the pixels identified as corresponding to the anatomical feature of interest are dilated: a mask is generated that includes a probability distribution for each pixel rather than binary labels. Pixels that were labeled in the non-dilated version will have the highest probability values, but adjacent pixels will have probability values that decay with distance from the labeled pixels. The rate of decay may be according to a gaussian function or other distribution function. Dilation facilitates training of a machine learning model 810 since a loss function 808 will increase gradually with distance of inferred pixel locations from labeled pixel locations rather than being zero at the labeled pixel locations and the same non-zero value at every other pixel location.

The training algorithm 802 may operate with respect to one or more loss functions 808 and modify a machine learning model 810 in order to train the machine learning model 810 to label the anatomical feature of interest in a given input image. The labeling performed using the machine learning model 810 may be performed on an image that has been reoriented using the approach of FIG. 3 and had contamination removed using the approach of FIG. 5. In some embodiments, a machine learning model 810 may be trained for each view of the FMX such that the machine learning model 810 is used to label teeth in an image that has previously been classified using the approach of FIG. 4 as belonging to the FMX view for which the machine learning model 710 was trained. As noted above, the tooth labels 804 b may be generated using the labeling approach of FIG. 8.

In the illustrated embodiment, the machine learning model 810 includes a GAN including a generator 812 and a discriminator 814. The discriminator 814 may have an output 816 embodied as a realism matrix that may be implemented as for other realism matrices in other embodiments as described above. The output of the generator 812 may also be input to a classifier 818 trained to produce an output 820 embodied as a label of the anatomical feature of interest, e.g. pixel mask labeling a portion of an input image estimated to correspond to the anatomical feature of interest. The generator 812 and discriminator 814 may be implemented according to the approach described above for the generator 712 and discriminator 714. The classifier 818 may be implemented according to the approach described above for the classifier 718.

Training of the machine learning model 810 may be performed by the training algorithm 802 as follows:

(Step 1). The image 804 a and tooth label 804 b are concatenated and input to the generator 812. Concatenation in this and other systems disclosed herein may include inputting two images (e.g., the image 804 a and tooth label 804 b) as different layers to the generator 812, such as in the same manner that different color values (red, green, blue) of a color image may be processed by a CNN according to any approach known in the art. The generator 812 may output synthetic labels 822 (e.g., pixel mask) of the anatomical feature of interest based on the image 804 a and tooth label 804 b.

(Step 2) The synthetic labels 822 and real labels 824 (e.g., an individual pixel mask from a repository including one or more labels) are then input to the discriminator 814. The real labels 824 are obtained by labeling the anatomical feature of interest in an image that is not paired with the image 804 a from Step 1. The discriminator 814 produces a realism matrix at its output 816 with each value of the matrix indicating whether the synthetic label 822 is real or fake. In some embodiments, the real labels 824 may be real labels that have been dilated using the same approach used to dilate the feature labels 806 to obtain the dilated feature labels 806. In this manner, the generator 812 may be trained to generate dilated synthetic labels 822.

(Step 3) The image 804 a, tooth label 804 b, and synthetic labels 822 are concatenated to obtain a concatenated input 826, which is then input to the classifier 818. The classifier 818 processes the concatenated input 826 and produces output labels 828 (pixel mask) that is an estimate of the pixels in the image 804 a that correspond to the anatomical feature of interest.

(Step 4) The loss functions 808 are evaluated with respect to the outputs of the generator 812, discriminator 814, and classifier 818. This may include evaluating a loss function LF1 based on the realism matrix output by the discriminator 814 at Step 2 such that the output of LF1 decreases with increase in the number of values of the realism matrix that indicate that the synthetic labels 822 are real. Step 4 may also include evaluating a loss function LF2 based on the realism matrix such that the output of LF2 decreases with increase in the number of values of the realism matrix that indicate that the synthetic labels 822 are fake. Step 4 may include evaluating a loss function LF3 based on a comparison of the synthetic label 822 output by the generator 812 and the dilated tooth feature label 806. In particular, the output of the loss function LF3 may decrease with increasing similarity of the synthetic label 822 and the dilated tooth label 804 b. Step 4 may include evaluating a loss function LF4 based on a comparison of the synthetic labels 828 to the non-dilated tooth label 804 b such that the output of the loss function LF4 decreases with increasing similarity of the synthetic labels 828 and the non-dilated tooth label 804 b.

(Step 5) The training algorithm 802 may use the output of loss function LF1 and LF3 to tune parameters of the generator 812. In particular, the generator 812 may be tuned to both generate realistic labels according to LF1 and to generate a probability distribution of a dilated tooth label according to LF3. The training algorithm 802 may use the output of loss function LF2 to tune parameters of the discriminator 814 and the output of the loss function LF4 to tune parameters of the classifier 818.

Steps 1 through 5 may be repeated such that the generator 812, discriminator 814, and classifier 818 are trained simultaneously. Steps 1 through 5 may continue to be repeated until an end condition is reached, such as until loss functions LF1, LF3, and LF4 meet a minimum value or other ending condition, which may include the discriminator 714 identifying the synthetic label 822 as real 50 percent of the time or Nash equilibrium is reached.

The training algorithm 802 and utilization of the trained machine learning model 810 may be implemented using PYTORCH and AWS GPU instances in the same manner as described above with respect to FIG. 3.

In at least one possible embodiment, the system 800 operates on three-dimensional images, such as a CT, by replacing two-dimensional convolutional kernels (e.g., 4×4 and 1×1) with three-dimensional convolution kernels (e.g., 4×4×4 or 1×1×1).

During utilization to identify the anatomical feature of interest, the discriminator 814 may be ignored or discarded. Input images 804 a with tooth labels 804 b but without feature labels 806 are processed using the discriminator to obtain a synthetic labels 822. The image 804 a, tooth labels 804 b, and synthetic labels 822 are concatenated and input to the classifier 818 that outputs a label 828 that is an estimate of the pixels corresponding to the anatomical feature of interest.

Below are example applications of the system 800 to label anatomical features:

-   -   In order to establish the correct diagnosis from dental images,         it is often useful to identify the cementum enamel junction         (CEJ). The CEJ can be difficult to identify in dental X-ray,         CBCT, and intra-oral images because the enamel is not always         clearly differentiated from dentin and the CEJ might be         obfuscated by overlapping anatomy from adjacent teeth or         improper patient setup and image acquisition geometry. To solve         this problem, the system 800 may be used to identify the CEJ         from images as the anatomical feature of interest.     -   In order to establish the correct diagnosis from dental images,         it is often useful to identify the point on maxilla or mandible         that correspond the periodontal disease. These boney points can         be difficult to identify in dental x-ray, CBCT, and intra-oral         images because the boney point is not always clearly         differentiated from other parts of the bone and might be         obfuscated by overlapping anatomy from adjacent teeth or         improper patient setup and image acquisition geometry. To solve         this problem, the system 800 may be used to identify the boney         point as the anatomical feature of interest.     -   In order to establish the correct diagnosis from dental images,         it is often useful to identify the gingival margin. This soft         tissue point can be difficult to identify in dental X-ray, CBCT,         and intra-oral images because the soft tissue point is not         always clearly differentiated from other parts of the image and         might be obfuscated by overlapping anatomy from adjacent teeth         or improper patient setup and image acquisition geometry. To         solve this problem, the system 800 may be used to identify the         gingival margin as the anatomical feature of interest.     -   In order to establish the correct diagnosis from dental images,         it is often useful to identify the junctional Epithelium (JM).         This soft tissue point can be difficult to identify in dental         X-ray, CBCT, and intra-oral images because the soft tissue point         is not always clearly differentiated from other parts of the         image and might be obfuscated by overlapping anatomy from         adjacent teeth or improper patient setup and image acquisition         geometry. To solve this problem, the system 800 may be used to         identify the JE as the anatomical feature of interest.

FIG. 9 is a schematic block diagram of system 900 for determining clinical attachment level (CAL) in accordance with an embodiment of the present invention. In order to establish the correct periodontal diagnosis from dental images, it is often useful to identify the clinical attachment level (CAL). CAL can be difficult to identify in dental x-ray, CBCT, and intra-oral images because CAL relates to the cementum enamel junction (CEJ), probing depth, junctional epithelium (JE), and boney point (B) on the maxilla or mandible which might not always be visible. Furthermore, the contrast of soft tissue anatomy can be washed out from adjacent boney anatomy because bone attenuates more x-rays than soft tissue. Also, boney anatomy might not always be differentiated from other parts of the image or might be obfuscated by overlapping anatomy from adjacent teeth or improper patient setup and image acquisition geometry. The illustrated system 900 may therefore be used to determine CAL.

In the system 900, A training algorithm 802 takes as inputs training data entries that each include an image 904 a and labels 904 b, e.g., pixel masks indicating portions of the image 904 a corresponding to teeth, CEJ, JE, B, or other anatomical features. The labels 904 b for an image 904 a may be generated by a licensed dentist or automatically generated using the tooth labeling system 700 of FIG. 7 and/or the labeling system 800 of FIG. 8. The image 904 a may have been one or both of reoriented according to the approach of FIG. 3 decontaminated according to the approach of FIG. 5. In some embodiments, a machine learning model 910 may be trained for each view of the FMX such that the machine learning model 910 is used to label teeth in an image that has previously been classified using the approach of FIG. 4 as belonging to the FMX view for which the machine learning model 910 was trained.

Each training data entry may further include a CAL label 906 that may be embodied as a numerical value indicating the CAL for a tooth, or each tooth of a plurality of teeth, represented in the image. The CAL label 906 may be assigned to the tooth or teeth of the image by a licensed dentist.

The training algorithm 902 may operate with respect to one or more loss functions 908 and modify a machine learning model 910 in order to train the machine learning model 910 to determine one or more CAL values for one or more teeth represented in an input image.

In the illustrated embodiment, the machine learning model 910 is a CNN including seven multi-scale stages 912 followed by a fully connected layer 914 that outputs a CAL estimate 916, such as a CAL estimate 916 for each tooth identified in the labels 904 b. Each multi-scale stage 912 may contain three 3×3 convolutional layers, paired with batchnormalization and leaky rectified linear units (LeakyReLU). The first and last convolutional layers of each stage 912 may be concatenated via dense connections which help reduce redundancy within the network by propagating shallow information to deeper parts of the network. Each multi-scale stage 912 may be downscaled by a factor of two at the end of each multi-scale stage by convolutional downsampling with stride 2. The third and fifth multi-scale stages 912 may be passed through attention gates 918 a, 918 b before being concatenated with the last multi-scale stage 912. The attention gate 918 a applied to the third stage 912 may be gated by a gating signal derived from the fifth stage 912. The attention gate 918 b applied to the fifth stage 912 may be gated by a gating signal derived from the seventh stage 912. Not all regions of the image are relevant for estimating CAL, so attention gates 918 a, 918 b may be used to selectively propagate semantically meaningful information to deeper parts of the network. Adam optimization may be used during training which automatically estimates the lower order moments and helps estimate the step size which desensitizes the training routine to the initial learning rate.

A training cycle of the training algorithm 902 may include concatenating the image 904 a with the labels 904 b of a training data entry and processing the concatenated data with the machine learning model 910 to obtain a CAL estimate 916. The CAL estimate 916 is compared to the CAL label 906 using the loss function 908 to obtain an output, such that the output of the loss function decreases with increasing similarity between the CAL estimate 916 and the CAL label 906. The training algorithm 902 may then adjust the parameters of the machine learning model 910 according to the output of the loss function 908. Training cycles may be repeated until an ending condition is reached, such as the loss function 908 reaching a minimum value or other ending condition being achieved.

The training algorithm 902 and utilization of the trained machine learning model 810 may be implemented using PYTORCH and AWS GPU instances in the same manner as described above with respect to FIG. 3.

In at least one possible embodiment, the system 900 operates on three-dimensional images, such as a CT, by replacing two-dimensional convolutional kernels (e.g., 3×3 and 1×1) with three-dimensional convolution kernels (e.g., 3×3×3 or 1×1×1).

FIG. 10 is a system 1000 for determining pocket depth (PD) in accordance with an embodiment of the present invention. In order to establish the correct periodontal diagnosis from dental images, it is often useful to identify the pocket depth (PD). PD can be difficult to identify in dental X-ray, CBCT, and intra-oral images because PD relates to the cementum enamel junction (CEJ), junctional epithelium (JE), gingival margin (GM), and boney point (B) on the maxilla or mandible which might not always be visible. Furthermore, the contrast of soft tissue anatomy can be washed out from adjacent boney anatomy because bone attenuates more x-rays than soft tissue. Also, boney anatomy might not always be differentiated from other parts of the image or might be obfuscated by overlapping anatomy from adjacent teeth or improper patient setup and image acquisition geometry. The illustrated system 1000 may therefore be used to determine PD.

In the system 1000, a training algorithm 1002 takes as inputs training data entries that each include an image 1004 a and labels 1004 b, e.g., pixel masks indicating portions of the image 1004 a corresponding to teeth, GM, CEJ, JE, B, or other anatomical features. The labels 1004 b for an image 1004 a may be generated by a licensed dentist or automatically generated using the tooth labeling system 700 of FIG. 7 and/or the labeling system 800 of FIG. 8. Each training data entry may further include a PD label 1006 that may be embodied as a numerical value indicating the pocket depth for a tooth, or each tooth of a plurality of teeth, represented in the image. The PD label 1006 may be assigned to the tooth or teeth of the image by a licensed dentist.

The image 1004 a may have been one or both of reoriented according to the approach of FIG. 3 decontaminated according to the approach of FIG. 5. In some embodiments, a machine learning model 1010 may be trained for each view of the FMX such that the machine learning model 1010 is used to label teeth in an image that has previously been classified using the approach of FIG. 4 as belonging to the FMX view for which the machine learning model 1010 was trained.

The training algorithm 1002 may operate with respect to one or more loss functions 1008 and modify a machine learning model 1010 in order to train the machine learning model 1010 to determine one or more PD values for one or more teeth represented in an input image. In the illustrated embodiment, the machine learning model 1010 is a CNN that may be configured as described above with respect to the machine learning model 910.

A training cycle of the training algorithm 1002 may include concatenating the image 1004 a with the labels 1004 b of a training data entry and processing the concatenated data with the machine learning model 1010 to obtain a PD estimate 1016. The PD estimate 1016 is compared to the PD label 1006 using the loss function 1008 to obtain an output, such that the output of the loss function decreases with increasing similarity between the PD estimate 1016 and the PD label 1006. The training algorithm 1002 may then adjust the parameters of the machine learning model 1010 according to the output of the loss function 1008. Training cycles may be repeated until an ending condition is reached, such as the loss function 1008 reaching a minimum value or other ending condition being achieved.

The training algorithm 1002 and utilization of the trained machine learning model 1010 may be implemented using PYTORCH and AWS GPU instances in the same manner as described above with respect to FIG. 3.

In at least one possible embodiment, the system 1000 operates on three-dimensional images, such as a CT, by replacing two-dimensional convolutional kernels (e.g., 3×3 and 1×1) with three-dimensional convolution kernels (e.g., 3×3×3 or 1×1×1).

FIG. 11 is a schematic block diagram of a system 1100 for determining a periodontal diagnosis in accordance with an embodiment of the present invention. The system 1100 may be used as part of step 114 of the method 100 in order to diagnose a condition that may trigger evaluation of a decision hierarchy. For example, if the machine learning model discussed below indicates that a diagnosis is appropriate, the condition of step 116 of the method 100 may be deemed to be satisfied.

In order to assess the extent of periodontal disease it is often useful to observe a multitude of dental images. Periodontal disease can be difficult to diagnosis on dental X-rays, CBCTs, and intra-oral images because periodontal disease relates to the cementum enamel junction (CEJ), junctional epithelium (JE), gingival margin (GM), boney point (B) on the maxilla or mandible, pocket depth (PD), gingival health, comorbidities, and clinical attachment level (CAL), which might not always be available. Furthermore, the contrast of soft tissue anatomy can be washed out from adjacent boney anatomy because bone attenuates more x-rays than soft tissue. Also, boney anatomy might not always be differentiated from other parts of the image or might be obfuscated by overlapping anatomy from adjacent teeth or improper patient setup and image acquisition geometry. To solve this problem, the illustrated system 1100 may be used in combination with the approaches of FIGS. 7 through 10 in order to derive a comprehensive periodontal diagnosis. The system 1100 may take advantage of an ensemble of unstructured imaging data and structured data elements derived from tooth masks, CEJ points, GM points, JE information, bone level points. All of this information may be input into the system 1000 and non-linearly combined via a machine learning model 1110.

For compatibility, all structured information (e.g. pixel mask labels, PD, and CAL values obtained using the approaches of FIGS. 7 through 10) may be converted to binary matrices and concatenated with the raw imaging data used to derive the structured information into a single n-dimensional array. Each image processed using the system 1100 may be normalized by the population mean and standard deviation of an image repository, such as a repository of images used for the unpaired images in the approach of FIGS. 5, 6A, 6B, 7, and 8 or some other repository of images.

In the system 1100, A training algorithm 1102 takes as inputs training data entries that each include an image 1104 a and labels 1104 b, e.g., pixel masks indicating portions of the image 1104 a corresponding to teeth, GM, CEJ, JE, B or other anatomical features. Each training data entry may further include a diagnosis 1106, i.e. a periodontal diagnosis that was determined by a licensed dentist to be appropriate for one or more teeth represented in the image 1104 a.

The image 1104 a may be an image that has been oriented according to the approach of FIG. 3 and had decontaminated according to the approach of FIG. 4. In some embodiments, a machine learning model 1110 may be trained for each view of the FMX such that the machine learning model 1110 is used to label teeth in an image that has previously been classified using the approach of FIG. 4 as belonging to the FMX view for which the machine learning model 1110 was trained.

The labels 1104 b for the image 1104 a of a training data entry may be generated by a licensed dentist or automatically generated using the tooth labeling system 700 of FIG. 7 and/or the labeling system 800 of FIG. 8. The labels 1104 b for a tooth represented in an image 1104 a may further be labeled with a CAL value and/or a PD value, such as determined using the approaches of FIGS. 9 and 10 or by a licensed dentist. The CAL and/or PD labels may each be implemented as a pixel mask corresponding to the pixels representing a tooth and associated with the CAL value and PD value, respectively, determined for that tooth.

In some embodiments, other labels 1104 b may be used. For example, a label 1104 b may label a tooth in an image with a pixel mask indicating a past treatment with respect to that tooth. Other labels 1104 b may indicate comorbidities of the patient represented in the image 1104 a.

The training algorithm 1102 may operate with respect to one or more loss functions 1108 and modify a machine learning model 1110 in order to train the machine learning model 1110 to determine a predicted diagnosis for one or more teeth represented in an input image.

In the illustrated embodiment, the machine learning model 1110 includes nine multi-scale stages 1112 followed by a fully connected layer 1114 that outputs a predicted diagnosis 1116. Each multi-scale stage 1112 may contain three 3×3 convolutional layers, paired with batchnormalization and leaky rectified linear units (LeakyReLU). The first and last convolutional layers of each stage 1112 may be concatenated via dense connections which help reduce redundancy within the network by propagating shallow information to deeper parts of the network. Each multi-scale stage 1112 may be downscaled by a factor of two at the end of each multi-scale stage 1112, such as by convolutional downsampling with stride 2. The fifth and seventh multi-scale stages 1112 may be passed through attention gates 1118 a, 1118 b before being concatenated with the last stage 1112. The attention gate 1118 a may be applied to the fifth stage 1112 according to a gating signal derived from the seventh stage 1112. The attention gate 1118 b may be applied to the seventh stage 1112 according to a gating signal derived from the ninth stage 1112. Not all regions of the image are relevant for estimating periodontal diagnosis, so attention gates may be used to selectively propagate semantically meaningful information to deeper parts of the network. Adam optimization may be used during training which automatically estimates the lower order moments and helps estimate the step size which desensitizes the training routine to the initial learning rate.

A training cycle of the training algorithm 1102 may include concatenating the image 1104 a with the labels 1104 b of a training data entry and processing the concatenated data with the machine learning model 1110 to obtain a predicted diagnosis 1116. The predicted diagnosis is compared to the diagnosis 1106 using the loss function 1108 to obtain an output, such that the output of the loss function decreases with increasing similarity between the diagnosis 1116 and the diagnosis 1106, which may simply be a binary value (zero of correct, non-zero if not correct). The training algorithm 1102 may then adjust the parameters of the machine learning model 1110 according to the output of the loss function 1108. Training cycles may be repeated until an ending condition is reached, such as the loss function 1108 reaching a minimum value or other ending condition being achieved.

The training algorithm 1102 and utilization of the trained machine learning model 1110 may be implemented using PYTORCH and AWS GPU instances in the same manner as described above with respect to FIG. 3.

In at least one possible embodiment, the system 1100 operates on three-dimensional images, such as a CT, by replacing two-dimensional convolutional kernels (e.g., 3×3 and 1×1) with three-dimensional convolution kernels (e.g., 3×3×3 or 1×1×1).

In another variation, several outputs from multiple image modalities or multiple images from a single modality are combined in an ensemble of networks to form a comprehensive periodontal diagnosis or treatment protocol. For example, a system 1100 may be implemented for each imaging modality of a plurality of imaging modalities. A plurality of images of the same patient anatomy according to the plurality of imaging modalities may then be labeled and processed according to their corresponding systems 1100. The diagnosis output for each imaging modality may then be unified to obtain a combined diagnosis, such as by boosting, bagging, or other conventional machine learning methods such as random forests, gradient boosting, or support vector machines (SVMs).

FIG. 12 is a schematic block diagram of a system 1200 for restoring missing data to images in accordance with an embodiment of the present invention. It is often difficult to assess the extent of periodontal disease or determine orthodontic information from a dental image, such as intra-oral photos, X-rays, panoramic, or CBCT images. Sometimes the images do not capture the full extent of dental anatomy necessary to render diagnostic or treatment decisions. Furthermore, sometimes patient sensitive information needs to be removed from an image and filled in with missing synthetic information so that it is suitable for a downstream deep learning model. The system 1200 provides an inpainting system that utilizes partial convolutions, adversarial loss, and perceptual loss. The inpainting system 1200 is particularly useful for restoring missing portions of images to facilitate the identification of caries.

The system 1200 may be used to train a machine learning model to restore missing data to images for use in pre-processing an image at step 108 of the method 100. In some embodiment, missing data may be restored to an image using the approach of FIG. 12 to obtain a corrected image and the corrected image may then be reoriented using the approach of FIG. 3 to obtain a reoriented image (though the image output from the approach of FIG. 3 may not always be rotated relative to the input image). Decontamination according to the approach of FIG. 5 may be performed and may be performed on an image either before or after missing data is restored to it according to the approach of FIG. 12.

In the system 1200, A training algorithm 1202 is trained using training data entries including an image 1204 and a randomly generated mask 1206 that defines portions of the image 1204 that are to be removed and which a machine learning model 1210 is to attempt to restore. As for other embodiments, the image 1204 of each training data entry may be according to any of the imaging modalities described herein. The training algorithm 1202 may operate with respect to one or more loss functions 1208 and modify the machine learning model 1210 in order to reduce the loss functions 1208 of the model 1210.

In the illustrated embodiment, the machine learning model 1210 is GAN including a generator 1212 and a discriminator 1214. The generator 1212 and discriminator may be implemented according to any of the approaches described above with respect to the generators 512, 612, 618, 712, 812 and discriminators 514, 614, 620, 714, 814 described above.

Training cycles of the machine learning model 1210 may include inputting the image 1204 and the random mask 1206 of a training data entry into the generator 1212. The mask 1206 may be a binary mask, with one pixel for each pixel in the image. The value of a pixel in the binary mask may be zero where that pixel is to be omitted from the image 1204 and a one where the pixel of the image 1204 is to be retained. The image as input to the generator 1212 may be a combination of the image 1204 and mask 1206, e.g. the image 1204 with the pixels indicated by the mask 1206 removed, i.e. replaced with random values or filled with a default color value. In some embodiments, rather than being ransom, the mask 1206 masks a portion of anatomy, such as one or more teeth, on or more restorations (filling, crown, implant, etc.), or any other items of dental anatomy described herein.

The generator 1212 may be trained to output a reconstructed synthetic image 1216 that attempts to fill in the missing information in regions indicated by the mask 1206 with synthetic imaging content. In some embodiments, the generator 1212 learns to predict the missing anatomical information based on the displayed sparse anatomy in the input image 1204. To accomplish this the generator 1212 may utilize partial convolutions that only propagate information through the network that is near the missing information indicated by the mask 1206. In some embodiments, the binary mask 1206 of the missing information may be expanded at each convolutional layer of the network by one in all directions along all spatial dimensions.

In some embodiments, the generator 1212 is a six multi-scale stage deep encoder-decoder generator and the discriminator 124 is a five multi-scale level deep discriminator. Each convolutional layer within the encoder and decoder stage of the generator 1212 may uses 4×4 partial convolutions paired with batchnormalization and rectified linear unit (ReLU) activations. Convolutional downsampling may be used to downsample each multi-scale stage and transpose convolutions may be used to incrementally restore the original resolution of the input signal. The resulting high-resolution output channels may be passed through a 1×1 convolutional layer and hyperbolic tangent activation function to produce the synthetic reconstructed image 1216.

At each iteration, the synthetic image 1216 and a real image 1218 from a repository may be passed through the discriminator 1214, which outputs a realism matrix 1220 in which each value of the realism matrix 1220 is a value indicating which of the images 1216, 1218 is real.

The loss functions 1208 may be implementing using weighted L1 loss between the synthetic image 1216 and input image 1204 without masking. In some embodiments, the loss functions 1208 may further evaluate perceptual loss from the last three stages of the discriminator 1214, style loss based on the Gram matrix of the extracted features from the last three stages of the discriminator, and total variation loss. The discriminator 1214 may be pretrained in some embodiments such that it is not updated during training and only the generator 1212 is trained. In other embodiments, the generator 1212 and discriminator 1214 may be trained simultaneously until the discriminator 1214 can no longer differentiate between synthetic and real images or a Nash equilibrium has been reached.

During utilization, the discriminator 1214 may be discarded or ignored. An image to be reconstructed may be processed using the generator 1212. In some embodiments, a mask of the image may also be input as for the training phase. This mask may be generated by a human or automatically and may identify those portions of the image that are to be reconstructed. The output of the generator 1214 after this processing will be a synthetic image in which the missing portions have been filled in.

In some embodiments, multiple images from multiple image modalities or multiple images from a single modality may combined in an ensemble of networks to form a comprehensive synthetic reconstructed image. For example, each image may be processed using a generator 1214 (which may be trained using images of the imaging modality of the each image in the case of multiple imaging modalities) and the output of the generators 1214 may then be combined. The outputs may be combined by boosting, bagging, or other conventional machine learning methods such as random forests, gradient boosting, or state vector machines (SVMs).

In at least one possible embodiment, the system 1200 may operate on three-dimensional images 1204, such as a CT scan. This may include replacing the 4×4 convolutional kernels with 4×4×4 convolutional kernels and replacing the 1×1 convolutional kernels with 1×1×1 convolutional kernels.

The training algorithm 1202 and utilization of the trained machine learning model 1210 may be implemented using PYTORCH and AWS GPU instances in the same manner as described above with respect to FIG. 3.

In at least one possible embodiment, the system 1200 operates on three-dimensional images, such as a CT, by replacing two-dimensional convolutional kernels (e.g., 4×4 and 1×1) with three-dimensional convolution kernels (e.g., 4×4×4 or 1×1×1).

In many instances, dental images may have text superimposed thereon, such as text identifying a patient, a date the image was taken, an identifier of the image in a sequence (e.g., FMX), a name of a dental technician or dentist, or other characters (numbers, letters, or other symbols).

In some embodiments, the random mask 1206 includes one or more random sequences of characters, each random sequence being placed either randomly on the image 1204 or at a typical location at which label text is added to dental images (e.g., at the top, bottom, left edge, or right edge). In this manner, the generator 1212 may be trained to regenerate portions of a dental image that have been covered by added text.

Referring generally to FIGS. 3 through 12, the machine learning models that are illustrated and discussed above are represented as CNNs. Additionally, specific CNN configurations are shown and discussed. It shall be understood that, although both a CNN generally and the specific configuration of a CNN shown and described may be useful and well suited to the tasks ascribed to them, other configurations of a CNN and other types of machine learning models may also be trained to perform the automation of tasks described above. In particular a neural network or deep neural network (DNN) according to any approach known in the art may also be used to perform the automation of tasks described above.

Referring to FIGS. 13 through 18, deep learning-based computer vision is being rapidly adopted to solve many problems in healthcare. However, an adversarial attack may probe a model and find a minimum perturbation to the input image that causes maximum degradation of the deep learning model, while simultaneously maintaining the perceived image integrity of the input image.

In dentistry, adversarial attacks can be used to create malicious examples that compromise the diagnostic integrity of automated dental image classification, landmark detection, distortion correction, image transformation, text extraction, object detection, image denoising, or segmentation models. Additionally, images might be manually tampered with in photoshop or other image manipulation software to fool a clinician into incorrectly diagnosing disease

Adversarial attacks have highlighted cyber security threats to current deep learning models. Similarly, adversarial attacks on medical automation systems could have disastrous consequences to patient care. Because many industries are increasingly reliant on deep learning automation solutions, adversarial defense and detection systems have become a critical domain in the machine learning community.

There are two main types of adversarial defense approaches. One approach uses a screening algorithm to detect if an image is authentic and the other approach builds models that are robust against adversarial images. The quality of the defense system is dependent on the ability to create high quality adversarial examples.

To produce adversarial examples, attackers need to gain access to the system. Black box attacks assume no knowledge of model parameters or architecture. Grey box attacks have architectural information but have no knowledge of model parameters. White box attacks have a priori knowledge of model parameters and architecture. White box adversarial examples may be used to evaluate the defense of each model, since white box attacks are the most powerful.

For white box attacks, an adversarial attacking system may be implemented by building attacks directly on each victim model. In some embodiments, the attack system uses a novel variation of the projected gradient decent (PGD) method (Madry Kurakin), which is an iterative extension of the canonical fast gradient sign method (Goodfellow). PGD finds the optimal perturbation by performing a projected stochastic gradient descent on the negative loss function.

For grey box attacks, an adversarial attacking system may be implemented by building attacks on the output of each victim model. Since grey box attacks do not have access to the gradients of the model, the output of each victim model may be used to update the gradients of the attacking model. The attacking model therefore becomes progressively better at fooling the victim model through stochastic gradient decent.

For black box attacks, an adversarial attacking system may be implemented by building attacks on the output of many victim models. Since black box attacks do not have access to the gradients of any model, the output of many victim models are used to update the gradients of the attacking model. The attacking model therefore becomes progressively better at fooling the victim model through stochastic gradient decent.

The systems disclosed herein may use adaptation of a coevolving attack and defense mechanism. After each epoch in the training routine, new adversarial examples may be generated and inserted into the training set. The defense mechanism is therefore trained to be progressively better at accurate inference in the presence of adversarial perturbations and the attack system adapts to the improved defense of the updated model.

Referring specifically to FIG. 13, the illustrated system 1300 may be used to train a machine learning model to identify authentic and corrupted images. In the system 1300, A training algorithm 1302 takes as inputs training data entries that each include an image 1304 and a status 1306 of the image 1304, the status indicating whether the image 1306 is contaminated or non-contaminated. The training algorithm 1302 also evaluates a loss function 1308 with respect to a machine learning model 1310. In particular, the training algorithm 1302 adjusts the machine learning model 1310 according to whether the machine learning model correctly determines the status 1306 of a given input image 1304.

In the illustrated embodiment, the machine learning model 1310 is an adversarial detection CNN. The CNN may include attention-gated skip connections and deep-supervision. In the illustrated embodiment, the CNN includes nine multi-scale stages 1312 followed by a fully connected layer 1314 that outputs an authenticity score 1320. Each multi-scale stage 1312 may contain three 3×3 convolutional layers, paired with batchnormalization and leaky rectified linear units (LeakyReLU). The first and last convolutional layers of each stage 1312 may be concatenated via dense connections which help reduce redundancy within the network by propagating shallow information to deeper parts of the network. Each multi-scale stage 1312 may be downscaled by a factor of two at the end of each multi-scale stage 1312, such as by max pooling. The fifth and seventh multi-scale stages 1312 may be passed through attention gates 1318 a, 1318 b before being concatenated with the last (ninth) stage 1312. The attention gate 1318 a may be applied to the fifth stage 1312 according to a gating signal derived from the seventh stage 1312. The attention gate 1318 b may be applied to the seventh stage 1312 according to a gating signal derived from the ninth stage 1312. Not all regions of the image are relevant for estimating periodontal diagnosis, so attention gates may be used to selectively propagate semantically meaningful information to deeper parts of the network. Adam optimization may be used during training which automatically estimates the lower order moments and helps estimate the step size which desensitizes the training routine to the initial learning rate.

In some embodiments, the images 1304 input to the network may be embodied as a raw 512×512 image 1304 and the output of the network may be a likelihood score 1320 indicating a likelihood that the input image 1304 is an adversarial example. The loss function 1308 may therefore decrease with accuracy of the score. For example, where a high score indicates an adversarial input image, the loss function 1308 decreases with increase in the likelihood score 1320 when the input image 1304 is an adversarial image. The loss function 1308 would then increase with increase in the likelihood score 1320 when the input image 1304 is not an adversarial image. The loss function 1308 may be implemented with categorical cross entropy and Adam optimization may be used during training which automatically estimates the lower order moments and helps estimate the step size which desensitizes the training routine to the initial learning rate.

The adversarial images 1304 in the training data set may be generated with any of projected gradient decent image contamination, synthetically generated images, and manually manipulated images by licensed dentists. Because the adversarial detection machine learning model 1310 may be sensitive to training parameters and architecture, a validation set may be used for hyperparameter testing and a final hold out test set may be used to assess final model performance prior to deployment.

The training algorithm 1302 and utilization of the trained machine learning model 1310 may be implemented using PYTORCH and AWS GPU instances in the same manner as described above with respect to FIG. 3.

In at least one possible embodiment, the system 1300 operates on three-dimensional images, such as a CT, by replacing two-dimensional convolutional kernels (e.g., 4×4 and 1×1) with three-dimensional convolution kernels (e.g., 4×4×4 or 1×1×1).

FIG. 14A is a schematic block diagram of a system 1400 a for protecting a machine learning model from adversarial input images 1402 in accordance with an embodiment of the present invention. In particular, the system 1400 a includes a detector 1404 that evaluates the authenticity of the input image 1402 and estimates whether the input image 1402 is adversarial. The detector 1404 may be implemented as the machine learning model 1310. If the image 1402 is found to be adversarial, the image is discarded as a contaminated image 1402

An adversarial network 1408 may receive an uncontaminated image 1410 and process the image 1410 to generate additive noise 1412 to contaminate the input image in order to deceive a victim machine learning model 1414. The victim model 1414 may be any machine learning model described herein or any machine learning model trained to transform images or generate inferences based on images. Each image 1410 may have an accurate prediction associated with an input image 1410 may be a prediction obtained by processing the input image 1410 using the victim model 1414 without added noise 1412 or according to labeling by some other means, such as by a human with expertise.

The noise 1412 is combined with the image 1410 to obtain the contaminated input image 1402 that is input to the detector 1404. The detector 1404 attempts to detect these adversarial images 1402 and discard them. Input images 1402 that are not found to be adversarial are then input to the machine learning model 1414 that outputs a prediction 1416. The prediction 1416 is more robust due to the presence of the detector 1404 inasmuch as there is more assurance that the image 1402 is not adversarial.

Referring to FIG. 14B, in some embodiments the illustrated system 1400 b may be used to train an adversarial network 1408 to generate noise 1412 for contaminating input images 1410. This may be with the intent of generating adversarial images for training purposes, such as for training the machine learning model 1310. In other applications, adversarial images may be generated from patient images in order to protect patient privacy, e.g., prevent automated analysis of the patient's images. Accordingly, the detector 1404 may be omitted in the embodiment of FIG. 14b in order to expose the victim model 1414 to the adversarial images and assess its response.

The loss function of the adversarial network 1408 may be based on the prediction 1414, i.e. if the loss function decreases with increasing inaccuracy of the prediction. For example, the input image 1408 may be part of a training data entry including an accurate prediction. The difference between the prediction 1414 and the accurate prediction may therefore be evaluated to determine the output of the loss function that is used to update the adversarial network.

In some embodiments, the loss function is a loss function 1418 that has two goal criteria minimizing 1420 noise and minimizing 1422 model performance, i.e. maximizing inaccuracy of the prediction 1416. Accordingly, the loss function 1418 may be a function of inaccuracy of the prediction 1416 relative to an accurate prediction associated with the input image 1408 and is also be a function of the magnitude of the adversarial noise 1412. The loss function 1418 therefore penalizes the adversarial network 1408 according to the magnitude of the noise and rewards the adversarial network 1408 according to degradation of accuracy of the victim model 1414.

The adversarial network 1408 and its training algorithm may be implemented according to any of the machine learning models described herein. In particular, the adversarial network 1408 may be implemented as a generator according to any of the embodiments described herein. In some embodiments, the adversarial network 1408 utilizes a six multi-scale level deep encoder-decoder architecture. Each convolutional layer within the encoder and decoder stage of the networks may use three 3×3 convolutions paired with batchnormalization and rectified linear unit (ReLU) activations. Convolutional downsampling may be used to downsample each multi-scale level and transpose convolutions may be used to incrementally restore the original resolution of the input signal. The resulting high-resolution output channels may be passed through a 1×1 convolutional layer and hyperbolic tangent activation function to produce adversarial noise 1412, which may be in the form of an image, where each pixel is the noise to be added to the pixel at that position in the input image 1410. At each iteration, the adversarial noise 1412 may be added to an image 1410 from a repository of training data entries to obtain the contaminated input image 1402. The contaminated input image 1402 may then be processed using the victim model 1414. The training algorithm may update model parameters of the adversarial network 1408 according to the loss function 1418. In some embodiments, the loss function 1418 is a function of mean squared error (MSE) of the adversarial noise 1412 and inverse cross entropy loss of the victim prediction 1416 relative to an accurate prediction associated with the input image 1408. In some embodiments, the victim model 1414 (e.g., machine learning model 1310) and the adversarial network 1408 may be trained concurrently.

FIG. 14C is a schematic block diagram of a system 1400 c for training a machine learning model to be robust against attacks using adversarial images in accordance with an embodiment of the present invention. In the illustrated embodiment, a contaminated image 1402, such as may be generated using an adversarial network, is processed using the victim model 1414, which outputs a prediction 1416. A training algorithm evaluates a loss function 1424 that decreases with accuracy of the prediction, e.g., similarity to a prediction assigned to the input image 1410 on which the contaminated image 1402 is based. The training algorithm then adjusts parameters of the model 1414 according to the loss function 1424. In the illustrated embodiment, the model 1414 may first be trained on uncontaminated images 1410 until a predefined accuracy threshold is met. The model 1414 may then be further trained using the approach of FIG. 14C in order to make the model 1414 robust against adversarial attacks.

FIG. 14D is a schematic block diagram of a system 1400 d for modifying adversarial images to protect a machine learning model from corrupted images in accordance with an embodiment of the present invention. In the illustrated embodiment, input images 1402, which may be contaminated images are processed using a modulator 1426. The modulator adds small amounts of noise to the input image to obtain a modulated image. The modulated image is then processed using the machine learning model 1414 to obtain a prediction 1416. The prediction is made more robust inasmuch as subtle adversarial noise 1412 that is deliberately chosen to deceive the model 1414 is combined with randomized noise that is not selected in this manner. The parameters defining the randomized noise such as maximum magnitude, probability distribution, and spatial wavelength (e.g., permitted rate of change between adjacent pixels) of the random noise may be selected according to a tuning algorithm. For example, images 1402 based on images 1410 with corresponding accurate predictions may be obtained using an adversarial network 1408, such as using the approach described above with respect to FIG. 14B. The images 1410 may be modulated by modulator 1426 and processed using the model 1414 to obtain predictions. The accuracy of this prediction 1416 may be evaluated, noise parameters modified, and the images 410 processed again iteratively until noise parameters providing desired accuracy of the prediction 1416 is achieved.

For example, a low amount of randomized noise may not be sufficient to interfere with the adversarial noise 1412, resulting in greater errors relative to an intermediate amount of noise that is greater than the low amount. Likewise, where a larger amount of noise greater than the intermediate amount is used, accuracy of the machine learning model 1414 may be degraded due to low image quality. Accordingly, the tuning algorithm may identify intermediate values for the noise parameters that balance adversarial noise disruption with image quality degradation.

In some embodiments, the modulator 1426 is a machine learning model. The machine learning model may be a generator, such as according to any of the embodiments for a generator described herein. The modulator 1426 may therefore be trained using a machine learning algorithm to generate noise suitable to disrupt the adversarial noise 1412. For example, training cycles may include generating a contaminated input image 1402 as described above, processing the contaminated input image 1402 using the modulator 1426 to obtain a modulated input. The modulated input is then processed using the model 1414 to obtain a prediction 1416. A loss function that decreases with increase in the accuracy of the prediction 1416 relative to the accurate prediction for the image 1410 used to generate the contaminated input image 1402 may then be used to tune the parameters of the modulator 1426.

FIG. 14E is a schematic block diagram of a system 1400 e for dynamically modifying a machine learning model to protect it from adversarial images in accordance with an embodiment of the present invention.

In the illustrated embodiment, input images 1402, which may be contaminated with adversarial noise 1412 are processed using a dynamic machine learning model 1428. In this manner, the ability to train the adversarial network 1408 to deceive the model 1428 is reduced relative to a static machine learning model 1414.

The dynamic machine learning model 1428 may be implemented using various approaches such as:

-   -   The parameters of a machine learning model 1414 as described         above are dynamically modified by different random noise each         time the model 1414 outputs a prediction 1416, with the noise         parameters of the random noise (maximum magnitude, probability         distribution, etc.) being selected such that accuracy of the         model 1414 is maintained within acceptable levels. The random         variations of the parameters impairs the ability of the         adversarial network 1408 to generate adversarial noise 1412 that         is both undetectable and effective in deceiving the model 1414.     -   A plurality of machine learning models 1414 are independently         trained to generate predictions 1416. Due to the stochastic         nature of the training of machine learning models, the         parameters of each machine learning model 1414 will be         different, even if trained on the same sets of training data.         Alternatively, different training data sets may be used for each         machine learning model 1414 such that each is slightly different         from one another. In yet another alternative, hyperparameters or         other parameters that govern training of each model may be         deliberately set to be different from one another. In yet         another alternative, different types of machine learning models         1414 (DNNs and CNNs) or differently structured machine learning         models (different numbers of stages, differently configured         stages, different attention gate configurations, etc.) may be         used in order to ensure variation among the machine learning         models 1414. The dynamic model 1428 may then (a) randomly select         among a plurality of models 1414 to make each prediction         1416, (b) combine predictions 1416 from all or a subset of the         models 1414 and combine the predictions 1416, (c) apply random         weights to the predictions 1416 from all or a subset of the         models 1414 and combine the weighted predictions to obtain a         final prediction that is output from the dynamic model 1428.

Referring to FIGS. 15 through 19, cross-institutional generalizability of AI models is hampered in dentistry because of privacy concerns. In addition, patient datasets from a clinic in Georgia might differ substantially from clinics in New York or San Francisco. A model trained on a dataset in one region might not perform well on patient populations originating from a different region of the world because clinical standards, patient demographics, imaging hardware, image acquisition protocols, software capabilities, and financial resources can vary domestically and internationally. Dentistry is particularly prone to cross-institutional variability because of the lack of clinical standardization and high degree of differentiation in oral hygiene practices among different patient populations.

Training dental AI models to reach cross-institutional generalizability is challenging from a data management and artificial intelligence (AI) model management perspective because in order to establish the correct treatment protocol or diagnosis many different data sources are often combined. To obtain the correct codes on dental procedures, dental image analytics may be combined with patient metadata, such as clinical findings, Decayed-Missing-Filled-Treated (DMFT) information, age, and historical records. However, in many cases the past medical history is not known or is not stored in a single place. Protected, disparate, restricted, fragmented, or sensitive patient information hinders aggregation of patient medical history.

To overcome this challenge, the approach described below with respect to FIGS. 15 through 19 may be used to allows models to learn from disparate data sources and achieve high cross-institutional generalizability while preserving the privacy of sensitive patient information.

Referring specifically to FIG. 15, in a typical implementation, there may be a central server 1500 that trains a machine learning model with respect to data from various institutions 1502. The institutions 1502 may be an individual dental clinic, a dental school, a dental-insurance organization, an organization providing storage and management of dental data, or any other organization that may generate or store dental data. The dental data may include dental images, such as dental images according to any of the two-dimensional or three-dimensional imaging modalities described hereinabove. The dental data may include demographic data (age, gender) of a patient, comorbidities, clinical findings, past treatments, Decayed-Missing-Filled-Treated (DMFT) information, and historical records.

As discussed below, a machine learning model may be trained on site at each institution with coordination by the central server 1500 such that patient data is not transmitted to the central server 1500 and the central server 1500 is never given access to the patient data of each central server 1500.

Referring to FIGS. 16 and 17, a method 1600 may include training 1602 individual machine learning models 1702 at each institution 1502 using a data store 1704 of that institution, the data store storing any of the dental data described above with respect to FIG. 15. Note that processing “at each institution 1502” may refer to computation using a cloud-based computing platform using an account of the institution such that the data store 1704 is accessible only by the institution and those allowed access by the institution. This may be any machine learning model trained using any algorithm known in the art, such as a neural network, deep neural network, convolution neural network, or the like. The machine learning model may be a machine learning model according to any of the approaches described above for evaluating a dental feature (tooth, JE, GM, CEJ, bony points), dental condition (PD, CAL), or diagnose a dental disease (e.g., any of the periodontal diseases described above). The machine learning model may also be trained to identify bone level, enamel, dentin, pulp, furcation, periapical lines, orthodontic spacing, temporal mandibular joint (TMJ) alignment, plaque, previous restorations, crowns, root canal therapy, bridges, extractions, endodontic lesions, root length, crown length, or other dental features or pathologies.

The machine learning models 1702 trained by each institution 1502 may be transmitted 1604 to the central server 1500, which combines 1606 the machine learning models 1702 to obtain a combined static model 1706. Combination at step 1606 may include bagging (bootstrap aggregating) the machine learning models 1702. For example, the combined static model 1706 may be utilized by processing an input using each machine learning model 1702 to obtain a prediction from each machine learning model 1702. These predictions may then be combined (e.g., averaged, the most frequent prediction selected, etc.) to obtain a combined prediction. Alternatively, the machine learning models 1702 themselves may be concatenated to obtain a single combined static machine learning model 1706 that receives an input and outputs a single prediction for that input.

The combined static model 1706 may then be transmitted 1608 by the server system 1500 to each of the institutions 1502.

Referring to FIG. 18, while still referring to FIG. 17, a method 1800 may be used to train a combined moving model 1708. The combined moving model 1708 is combined by the server system 1500 with the combined static model 1706 to obtain a combined prediction 1710 for a given input during utilization. The combined moving model 1708 may be trained by circulating the combined moving model 1708 among the plurality of institutions 1502 and training the combined moving model 1708 in combination with the combined static model 1706 at each of the institutions 1502. This may be performed in the manner described below with respect to step 1806.

For example, the method 1800 may include the central server 1500 generating 1801 an initial moving base model that is used as the combined moving model 1708 in the first iteration of the method 1800. The initial moving base model may be populated with random parameters to provide a starting point for subsequent training. Alternatively, the initial moving base model may be trained using a sample set of training data. This initial training may include training the initial moving base model in combination with the combined static model 1706

One or more institutions 1502 are then selected 1802 by the central server 1500, for example, from 1 to 10 institutions. Where a single institution 1500 is processed at each iteration of the method 1800, the method 1800 may proceed differently as pointed at various points in the description below. The groups of institutions 1500 selected may be static, i.e. the same institutions will be selected as a group whenever that group is selected, or dynamic, i.e. each selection at step 1802 until a predefined number of institutions have been selected.

The selection at step 1802 may be performed based on various criteria. As will be discussed below, the moving base model as trained at each institution may be transmitted among multiple institutions. Accordingly, the latency required to transmit data among the institutions 1502 may be considered in making the selection at step 1802, e.g., a solution to the traveling salesman problem may be obtained to reduce the overall latency of transmitting the moving base model among the institutions 1502. In some embodiments, step 1802 may include selecting one or more institutions based on random selection with the probability of selection of each institution 1502 being a function of quality of data (increasing probability of selection with increasing quality) and time since the each institution 1502 was last selected according to the method 1800 (increasing probability of selection with increasing time since last selection). Quality of data may be a metric of the institution 1502 indicating such factors as authoritativeness in field (e.g., esteemed institution in field of dentistry), known accuracy, known compliance with record-keeping standards, known clean data (free of defects), quantity of data available, or other metric of quality.

The method 1800 may then include the central server 1500 transmitting 1804 the moving base model to the selected institutions 1502. For the first iteration of the method 1800, this may include transmitting the initial moving base model to the selected institutions 1502. Otherwise, it is the combined moving model 1708 resulting from a previous iteration of the method 1800.

Each institution 1402 then trains a moving base model 1712 that is initially a copy of the base model received at step 1804, which is then combined with the combined static model 1706 transmitted to the institutions 1502 at step 1608. For example, each of the moving base model 1712 and the combined static model 1706 may include multiple layers, including multiple hidden layers positioned between a first layer and a last layer, such as a deep neural network, convolution neural network, or other type of neural network. One or more layers including the last layer and possibly one or more layers immediately preceding the last layer are removed from the combined static model 1706. For example, where the combined static model 1706 is a CNN, the fully connected layer and possibly one or more of the multi-scale stages immediately preceding it may be removed.

The outputs of the last layer remaining of the combined static model 1706 is then concatenated with outputs of a layer of the moving base model 1712 positioned in front of a final layer (e.g., a fully connected layer), e.g. at least two layers in front of the final layer (hereinafter “the merged layer”). For example, the combined static model 1706 (prior to layer removal) and the moving base model 1712 may be identically configured, e.g. same number of stages of the same size. For example, each may be a CNN having the same number of stages with the starting stages being of the same size, the same downsampling between stages, and each ending with a fully connected layer. However, in other embodiments, the models 1706, 1712 may have different configurations.

Concatenating outputs of the final layer of the truncated combined static model 1706 with the outputs of the merged layer may include a combined output that has double the depth of the outputs of the final layer and merged layer individually. For example, where the final layer has a 10×10 output with a depth of 100 (10×10×100) would become a 10×10×200 stage following concatenation. In other embodiments, the outputs of the final layer and merged layer may be concatenated and input to a consolidation layer such that the depth output from the consolidation layer is the same as the output of the merged layer (e.g. 10×10×100 instead of 10×10×200). The consolidation layer may be a machine learning stage, e.g. a multi-scale network stage followed by downsampling by a factor of 2, such that training of the combined static model 1706 and moving base model 1712 includes training the consolidation layer to select values from the final layers of the truncated models to output from the consolidation layer.

The moving base model 1712 as combined with the combined static model 1706 may then be trained 1806 at the selected institution 1502. This may include, for each training data entry of a plurality of training data entries, an input to the first stage of the combined static model 1706 and the moving base model 1712 to obtain a prediction 1714. The training data may be the same as or different from the training data used to train the static models at step 1602. The parameters of the moving base model 1712 may then be modified according to the accuracy of the predictions 1714 for the training data entries, e.g. as compared to the desired outputs indicated in the training data entries. The parameters of the combined static model 1706 may be maintained constant. The manner in which the moving base model 1712 and combined static model 1706 are combined may be as described in the following paper, which is hereby incorporated herein by reference in its entirety:

-   -   Kearney, V., Chan, J. W., Wang, T., Perry, A., Yom, S. S., &         Solberg, T. D. (2019). Attention-enabled 3D boosted         convolutional neural networks for semantic CT segmentation using         deep supervision. Physics in Medicine & Biology, 64(13), 135001.

The method 1700 may include returning 1808 gradients obtained during the training at step 1806 to the server system 1500. As known in the art, the weights and other parameters of a machine learning model may be selected according to gradients. These gradients change over time in response to evaluation of a loss function with respect to a prediction from the machine learning model in response to an input of a training data entry and a desired prediction indicating in the training data entry. Accordingly, the gradients of the moving base model 1712 as constituted after the training step 1806 may be returned 1808 to the central server. Note that since gradients are of interest and are what is provided to the central server 1500 in some embodiments, the training step 1806 may be performed up to the point that gradients are obtained but the moving base model 1712 is not actually updated according to the gradients.

The gradients from the multiple institutions selected at step 1802 may then be combined by the server system 1500 to obtain combined gradients, e.g. by averaging the gradients to obtain averaged gradients. The combined gradients may then be used to select new parameters for the combined moving model 1708 and the combined moving model 1708 is then updated according to the new parameters.

FIG. 19 illustrates an approach 1900 for combining gradients from each moving base model 1712 at each institution 1502. Each institution 1502 trains the moving base model 1712 using its data store 1704 to obtain base gradients 1902 that define how to modify the parameters of the moving base model 1712 in subsequent iterations. The base gradients 1902 are returned to the central server 1500 that combines the base gradients 1902 to obtain combined gradients 1904. These combined gradients 1904 are then used to update the combined moving model 1708 on the server. The combined moving model 1708 as updated is then transmitted to the institutions 1502 and used and the moving base model 1712 in the next iteration of the method 1800. Note that the institutions 1502 that receive the updated combined moving model 1708 may be different from those that provided the base gradients 1902 since different institutions 1502 may be selected at each iteration of the method 1800.

Returning again to FIG. 18, the method 1800 may include the central server 1500 evaluating 1812 model convergence. For example, each institution selected at step 1802 may return values of the loss function of the training algorithm for inputs processed using the moving base model 1712 during the training step 1806. The central server 1500 may compare the values of the loss function (e.g., an average or minimum of the multiple values reported) to the values returned in a previous iteration to determine an amount of change in the loss function (e.g. compare the minimum loss function values of the current and previous iteration).

The method 1800 may include selecting a learning period 1814 according to the rate of convergence determined at step 1812. The learning period may be a parameter defining how long a particular institution 1502 is allowed to train 1806 its moving base model 1712 before its turn ends and the selection process 1802 is repeated. As the rate of convergence becomes smaller, the learning period becomes longer. Initially, the rate of convergence may be high such that new institutions 1502 are selected 1802 at first intervals. As the rate of convergence falls, institutions 1502 are selected 1802 at second intervals, longer than the first intervals. This allows for a highly diverse training sets at initial stages of training, resulting in more rapid training of the combined moving model 1708. Enforcement of the learning period may be implemented by the central server 1500 by either (a) instructing each institution 1502 to perform the training step 1806 for the learning period or (b) instructing the institution 1502 to end the training step 1806 upon expiry of the learning period following selection 1802 or some time point after selection of the institution 1502.

The method 1800 may then repeat from step 1802 with selection 1802 of another set of institutions 1502. Since the selection 1802 is random, it is possible that one or more of the same institutions 1502 may be included in those select in the next iteration of the method 1800.

In embodiments where a single institution 1502 is selected at step 1802, step 1810 may be modified. For example, the institution may send the gradients of the moving base model 1712 to the central server, which then updates the parameters of the combined moving model 1708 according to the gradients without the need to combine the gradients with those of another institution. Alternatively, parameters of the moving base model 1712 may be updated by the institution according to the training step 1806 and the moving base model 1712 may be transmitted to the central server 1500, which then uses the moving base model 1712 as the combined moving model 1708 for a subsequent iteration of the method 1800. Since the institution 1502 may update the combined moving model 1708, the institution 1502 may transmit the combined moving model 1708 to another institution 1502 selected by the server system 1500 rather than sending the updated combined moving model 1708 to the server system 1500.

When the combination of the combined static model 1706 and the combined moving model 1708 have reached a desired level of accuracy and/or have converged (i.e., change between iterations of the method 1800 is below a predefined convergence threshold or threshold condition), the combination may then be used to generate combined predictions 1710 either on the server system 1500 or by transmitting the latest version of the combined moving model 1708 to the institutions such that they may generate predictions along with their copy of the combined static model. The combined moving model 1708 may be combined with the combined static model 1706 in the same manner as described above with respect to step 1806 for combining the moving base model 1712 with the combined static model 1706, i.e. truncating the combined static model 1706 to obtain a truncated model and concatenating the outputs of the truncated model with outputs of an intermediate layer of the combined moving model 1708.

The approach of FIG. 18 may have the advantage that, when the combined static model 1706 is maintained constant, catastrophic forgetting that might result from only sequential training is reduced. Likewise, where only the parameters of the combined moving model 1708 are updated, the processing of batches of training data at each iteration at an institution 1500 is speeded up and batch size may be increased. The only processing using the combined static model 1706 is a forward pass of input data and computation of gradients or new parameters can be omitted for the combined static model 1706.

FIG. 20 includes a schematic representation of dental anatomy that may be represented in a dental image according to any of the imaging modalities described herein. For example, one or more teeth 2000 may be represented. Each tooth 2000 may have a CEJ 2002 that can be measured at various points around the tooth 2000. A GM, e.g., gum line, 2004 may also be represented along with the bone level 2006. Parts of a the teeth 2000 such as pulp 2008 and dentin 2010 may also be identified. Carious lesions (e.g., caries or cavities) 2012 may also be represented.

A machine learning model, such as any of the architectures described herein for labeling teeth (see, e.g., the approach of FIG. 8) may be used to label dental anatomy. Likewise, the approaches described above for measuring features of dental anatomy (see, e.g., the approach of FIGS. 9 and 10) may be used to measure dental anatomy. In particular, training data entries including images (inputs) and labels of the dental anatomy (desired output) may be used to train a machine learning model to output dental anatomy labels for a given input image, such as according to the approaches described hereinabove. Likewise, training data entries including images and labels of dental anatomy (input) and labels of measurements of dental anatomy (desired output) may be used to train a machine learning model to output measurements for a given input image with its corresponding labels of dental anatomy, such as according to the approaches described herein above. In particular, the machine learning model may be a CNN. However, other machine learning approaches, such as random forest, gradient boosting, support vector machine, or the like may also be used.

For a given item of dental anatomy, such as any of those referenced herein, particularly those referenced with respect to FIG. 20, one or more machine learning models may be trained to measure that item of dental anatomy. Measurements of an item of dental anatomy may include its center of mass, relative distance to other anatomy, size distortion, and density.

For a carious lesion 2012 in a tooth 2000, machine learning models may be trained to obtain the following measurements of the carious lesion 2012: volume, area, distance to pulp, percent of tooth covered by it, distance into dentin, involved surfaces of the tooth, and identifier of the affected tooth. Machine learning models may also be trained to identify fillings or other restorations on teeth and their measurements such as volume, area, percent of tooth covered by it, involved surfaces of the tooth, material, type, and identifier of the affected tooth.

Machine learning models may be trained to identify and measure periodontal anatomy such as distal gingival margin, mesial gingival margin, distal CAL, mesial CAL, distal PD, mesial PD, distal bone level, mesial bone level, and the identifier of the tooth for which the periodontal anatomy is identified and measured.

Machine learning models may be trained to identify and measure dental anatomy that may be used to determine the appropriateness of root canal therapy at a given tooth position such as crown-to-root-ratio, calculus, root length, relative distance to adjacent teeth, furcation, fracture, and whether the tooth at that tooth position is missing.

The manner in which a machine learning model is trained to perform any of these measurements may be as described above with respect to FIG. 10 except that any of the above-described measurements may be used in the place of pocket depth. Likewise, additional or alternative labels (e.g., pixel masks) of features in an image may be used, such as labels for caries, restorations on caries, or defects in restorations as described below.

FIG. 21 is a schematic block diagram of a system 2100 for identifying perturbations to anatomy labels in accordance with an embodiment of the present invention. The system 2100 may include an encoder network 2102. The encoder network 2102 may include a number of multi-scale stages with downsampling between them with the last stage coupled to a fully connected layer. The encoder network 2102 may be implemented according to any of the approaches described above for implementing a CNN. Other machine learning approaches may also be used, such as random forest, gradient boosting, or support vector machine.

Training data entries may each include an image 2104, such as an image of dental anatomy according to any of the imaging modalities described herein. Each training data entry may further include an anatomy label 2106, which may be a label of any dental anatomy (including caries or other dental pathologies) as described herein. Each training data entry may further include a perturbation style 2108. The perturbation style 2108 includes an adjustment to boundaries of the anatomy label (e.g., pixel mask) 2106. In particular, the perturbation style 2108 may include erosion, e.g., shrinking of the image area occupied by the label 2106, dilation, e.g. expanding the image area occupied by the label 2106, increasing roughness of the boundary of the label 2106, or increasing smoothness of the boundary of the label 2106, or changing another property of the label 2016. The perturbation style 2108 may be represented in a predefined format, e.g. a numerical value indicating the type of the perturbation (erode, dilate, roughen boundary, smooth boundary) and a degree of the perturbation (amount of erosion, amount of dilation, amount of roughening, amount of smoothing). The values may be interpreted according to a perturbation algorithm that implements the type and the degree of perturbation on a given input label.

The label 2106 may be adjusted according to the perturbation style 2108 (eroded, dilated, roughened, or smoothed), such as using the perturbation algorithm, to obtain a perturbed anatomy label 2110. The perturbed anatomy label 2110 and image 2104 are concatenated and input to the encoder 2102 that outputs an estimated perturbation style. The loss function may therefore increase with an increase in the difference between the estimated perturbation style 2112 and the perturbation style 2108 of the training data entry. Accordingly, the training algorithm may process training data entries and adjust parameters of the encoder 2102 according to the loss function to train the encoder 2102 to determine the perturbation style 2108 for a given input image.

Following training, an image 2014 and anatomy label 2106 may be processed using the encoder 2102 to obtain an estimated perturbation style of the image. Perturbation styles for a set of images, each having an anatomy label, may be obtained using the encoder 2102 and the perturbation styles may be aggregated, e.g. averaged, to characterize the approach to labeling of a source of the set of images. For example, the images may be images labeled by an individual dental professional or dental professionals in a given geographic region (e.g., city, state, or country).

FIG. 22 is a schematic block diagram of another system 2200 for identifying perturbations to anatomy labels in accordance with an embodiment of the present invention. The system 2200 may include an encoder network 2202. The encoder network 2202 may include a number of multi-scale stages with downsampling between them. The encoder network 2202 may be implemented according to any of the approaches described above for implementing a CNN. However, in the illustrated embodiment, the fully connected layer is omitted and the output of the last stage is a matrix of values, such as 4×4 matrix. The encoder 2202 may be an encoder 2102 trained as described above with respect to FIG. 22 except that, following training, the fully connected (FC) layer is removed. Accordingly, an input image 2204 and a label 2206 of anatomy (e.g., pixel mask) are concatenated and processed using the encoder 2202 to obtain a style matrix 2208 that encodes attributes of the label that can be used to characterize a labeling style of the individual that created the label 2206. The encoder 2202 may also be implemented using another machine learning approach, such as random forest, gradient boosting, or support vector machine.

Style matrices may be obtained for a set of images, each having an anatomy label, using the encoder 2202 and the style matrices may be aggregated, e.g. averaged, to characterize the approach to labeling of a source of the set of images. For example, the images may be images labeled by an individual dental professional or dental professionals in a given geographic region (e.g., city, state, or country).

FIG. 23 is a schematic block diagram of a system 2300 for identifying caries based on anatomy labeling style in accordance with an embodiment of the present invention. The system 2300 includes a generator 2302 coupled to a discriminator 2304. The generator 2302 may be an encoder-decoder and the discriminator 2304 may be an encoder. The generator 2302 and discriminator 2304 may be implemented and trained using any of the approaches described herein for implementing a generator and discriminator of a GAN, such as using CNNs. Other machine learning approaches may also be used, such as random forest, gradient boosting, or support vector machine.

The generator 2302 takes as inputs an image 2306, a tooth label 2308 (e.g., pixel mask showing pixels representing a tooth), and a restoration label 2310 (e.g., pixel mask showing pixels representing a restoration on the tooth). These inputs are concatenated and processed using the generator 2302 to obtain a synthetic caries label 2312, e.g. a pixel mask showing one or more caries corresponding to the dental image, tooth of interest, and corresponding restoration represented by the label 2310, 2308, 2306. The synthetic caries label 2312 may be input with a real caries label 2314 to the discriminator 2404. The real caries label 2314 may be a pixel mask for one or more caries represented in an unpaired dental image (not the image 2306 or an image of the same anatomy represented in the image 2306). The synthetic caries label 2312 and real caries label 2314 are input to the discriminator 2304 that outputs a realism matrix 2316 such that each value of the realism matrix is an estimate as to which of the labels 2312, 2314 is real. As for other embodiments described herein, an aggregation (average, most frequent estimate) may be used by a loss function of the training algorithm.

The synthetic caries label 2312 may also be compared to a target caries label 2318 that is a pixel mask labeling one or more caries representing a ground truth caries label. The result of this comparison is a generator loss 2320 that increases with increase in differences between the labels 2312, 2318. Accordingly, the generator 2302 may be trained by a training algorithm that adjusts the generator 2302 to reduce the generator loss 2320 and to increase the likelihood that the realism matrix 2316 will indicate that the synthetic caries 2312 are real. The training algorithm likewise trains the discriminator 2304 to correctly identify the synthetic caries labels 2312 as fake. Training may continue until the generator loss 2320 converges and the discriminator 2304 cannot distinguish between the synthetic and real caries labels 2312, 2314 or Nash equilibrium is reached.

As shown in FIG. 23, training may additionally be performed with reference to an individual style matrix 2322 (style matrix for an individual labeler) and/or a geography style matrix 2324 (style matrix for labelers within a geographic region) of a training data entry. The matrices 2322, 2324 may be obtained using the system 2200 for the labeler that generated the target caries labels 2318 for the images 2306. The style matrices 2322, 2324 may be concatenated with one another and with an output of one of the stages of the generator 2302 and the result of the concatenation may then be input to the next stage of the generator 2302. For example, the matrices 2322, 2324 may be concatenated with the output of the stage 2326 that is the last stage of the encoder and the first stage of the decoder of the generator 2302.

During training, each training data entry may therefore include as inputs image 2306, a tooth label 2308, restoration label 2310, and one or both of a style matrix 2322 and geography style matrix 2324 for the labeler that generated the labels 2308, 2310, 2318. Each training data entry may also include a target caries label 2318 as a desired output of the training data entry. In this manner, the generator 2302 is trained to identify caries while taking into account variations in labeling behaviors of individuals and populations in a given geographic area.

FIG. 24 is a schematic block diagram of a system 2400 for detecting defects in a restoration in accordance with an embodiment of the present invention. The system 2400 includes a generator 2402 coupled to a discriminator 2404. The generator 2402 may be an encoder-decoder and the discriminator 2404 may be an encoder. The generator 2402 and discriminator 2404 may be implemented and trained using any of the approaches described herein for implementing a generator and discriminator of a GAN, such as CNNs. Other machine learning approaches may also be used, such as random forest, gradient boosting, or support vector machine.

The generator 2402 takes as inputs an image 2406, a tooth label 2408 (e.g., pixel mask showing pixels representing a tooth), and a restoration label 2410 (e.g., pixel mask showing pixels representing a restoration on the tooth), and a caries label 2412 (e.g., pixel mask showing pixels representing one or more caries repaired by the restoration shown by the label 2410). These inputs are concatenated and processed using the generator 2402 to obtain a synthetic defect label 2414, e.g. a pixel mask showing defects in the restoration shown by label 2410. Defects in a restoration, such as a filling, crown, root canal, veneer, or other restoration may include erosion around the edges of a filling, decay around a crown, a root canal that is not sufficiently deep, endodontic disease around a root canal, void or open contact around the filling or crown, fracture of the filling or crown, incorrect fitting of a crown or filling, compromised restoration material such as the liner or base, or other decay around the restoration.

The synthetic defect label 2414 may be input with a real defect label 2416 to the discriminator 2404. The real defect label 2416 may be a pixel mask for one or more defects represented in an unpaired dental image (not the image 2406 or an image of the same anatomy represented in the image 2406). The synthetic defect label 2414 and real caries label 2416 are input to the discriminator 2404 that outputs a realism matrix 2418 such that each value of the realism matrix is an estimate as to which of the labels 2414, 2416 is real.

The synthetic defect label 2414 may also be compared to a target defect label 2420 that is a pixel mask labeling one or more defects of the restoration represented in the restoration label 2410. The result of this comparison is a generator loss 2422 that increases with increase in differences between the labels 2414, 2420. Accordingly, the generator 2402 may be trained by a training algorithm that adjusts the generator 2402 to reduce the generator loss 2422 and to increase the likelihood that the realism matrix 2316 will indicate that the synthetic defect labels 2414 are real. The training algorithm likewise trains the discriminator 2404 to correctly identify the synthetic defect labels 2414 as fake. Training may continue until the generator loss 2422 converges and the discriminator 2404 cannot distinguish between the synthetic and real defect labels 2414, 2416 or Nash equilibrium is reached.

As shown in FIG. 24, training may additionally be performed with reference to an individual style matrix 2424 (style matrix for an individual labeler) and/or a geography style matrix 2426 (style matrix for labelers within a geographic region) of a training data entry. The matrices 2424, 2426 may be obtained using the system 2200 for the labeler that generated the target defect labels 2420 for the images 2406. The style matrices 2424, 2426 may be concatenated with one another and with an output of one of the stages of the generator 2402 and the result of the concatenation may then be input to the next stage of the generator 2402. For example, the matrices 2424, 2426 may be concatenated with the output of the stage 2428 that is the last stage of the encoder and the first stage of the decoder of the generator 2402.

During training, each training data entry may therefore include as inputs an image 2406, a tooth label 2408, restoration label 2410, caries label 2412, and one or both of a style matrix 2424 and geography style matrix 2426 for the labeler that generated the labels 2408, 2410, 2412, 2420. Each training data entry may also include a target defect label 2420 as the desired output of the training data entry. In this manner, the generator 2402 is trained to identify defects in restorations while taking into account variations in labeling behaviors of individuals and populations in a given geographic area.

FIG. 25 is a schematic block diagram of a system 2500 for selecting a restoration for a tooth in accordance with an embodiment of the present invention. The system 2500 includes a generator 2502 coupled to a discriminator 2504. The generator 2502 may be an encoder-decoder and the discriminator 2504 may be an encoder. The generator 2502 and discriminator 2504 may be implemented and trained using any of the approaches described herein for implementing a generator and discriminator of a GAN, such as CNNs. Other machine learning approaches may also be used, such as random forest, gradient boosting, or support vector machine.

The generator 2502 takes as inputs an image 2506 and a tooth label 2508 (e.g., pixel mask showing pixels representing a tooth). These inputs are concatenated and processed using the generator 2502 to obtain a synthetic restoration label 2510, e.g. a pixel mask showing an area for which a restoration is estimated for the tooth represented by the label 2508 and the input image represented by label 2506.

The synthetic restoration label 2510 may be input with a real restoration label 2512 to the discriminator 2504. The real restoration label 2512 may be a pixel mask of the area occupied by one or more restorations represented in an unpaired dental image (not the image 2506 or an image of the same anatomy represented in the image 2506). The synthetic restoration label 2510 and real restoration label 2512 are input to the discriminator 2504 that outputs a realism matrix 2514 such that each value of the realism matrix is an estimate as to which of the labels 2510, 2512 is real.

The synthetic restoration label 2510 may also be compared to a target restoration label 2516 that is a pixel mask labeling the area occupied by one or more restorations actually performed on the tooth labeled by the tooth label 2508.

The result of this comparison is a generator loss 2518 that increases with increase in differences between the labels 2510, 2516. Accordingly, the generator 2502 may be trained by a training algorithm that adjusts the generator 2502 to reduce the generator loss 2518 and to increase the likelihood that the realism matrix 2514 will indicate that the synthetic restoration labels 2510 are real. The training algorithm likewise trains the discriminator 2504 to correctly identify the synthetic restoration labels 2510 as fake. Training may continue until the generator loss 2518 converges and the discriminator 2504 cannot distinguish between the synthetic and real restoration labels 2510, 2512 or Nash equilibrium is reached.

As shown in FIG. 25, training may additionally be performed with reference to an individual style matrix 2520 (style matrix for an individual labeler) and/or a geography style matrix 2522 (style matrix for labelers within a geographic region) of a training data entry. The matrices 2520, 2522 may be obtained using the system 2200 for the labeler that generated the target restoration labels 2516 for the images 2506. The style matrices 2520, 2522 may be concatenated with one another and with an output of one of the stages of the generator 2502 and the result of the concatenation may then be input to the next stage of the generator 2502. For example, the matrices 2520, 2522 may be concatenated with the output of the stage 2524 that is the last stage of the encoder and the first stage of the decoder of the generator 2502.

During training, each training data entry may therefore include as inputs an image 2506, tooth label 2508, and one or both of a style matrix 2520 and geography style matrix 2522 for the labeler that generated the labels 2508, 2516. Each training data entry may also include a target restoration label 2516 as the desired output for the training entry. In this manner, the generator 2502 is trained to select an appropriate restoration for a tooth while taking into account variations in labeling behaviors of individuals and populations in a given geographic area.

FIG. 26 is a schematic block diagram of a system 2600 for identifying surfaces of a tooth having caries in accordance with an embodiment of the present invention. Caries are often identified by evaluating two-dimensional images, such as X-rays. It may not always be apparent from an X-ray which surface of a tooth bears a carious lesion. For example, an apparent carious lesion may be on the surface facing the viewer or away from the viewer.

The illustrated system 2600 may be used to estimate the surface of a tooth in which caries are present. As known in the field of dentistry, these surfaces may be the mesial (facing forward), occlusal (chewing surface), distal (facing rearward), buccal (facing toward the cheek), and lingual (facing toward the tongue) (designated herein as M, O, D, B, and L, respectively).

The system 2600 may include an encoder network 2602. The encoder network 2602 may include a number of multi-scale stages with downsampling between them with the last stage coupled to a fully connected layer. The encoder network 2602 may be implemented according to any of the approaches described above for implementing a CNN. Other machine learning approaches may also be used, such as random forest, gradient boosting, or support vector machine.

Training data entries may each include an image 2604, such as an image of dental anatomy according to any of the imaging modalities described herein. Each training data entry may further include a tooth label 2606 (pixel mask indicating portion of image 2604 representing a tooth), caries label 2608 (pixel mask indicating portions of the image 2604 corresponding to one or more caries on the tooth indicated by the label 2606), and a restoration label 2610 (pixel mask indicating portions of the image 2604 representing any previous restoration performed with respect to the caries on the tooth represented by the label 2606).

The image 2604 and labels 2606-2610 may be concatenated and processed using the encoder 2602. The encoder 2602 then generates an output 2612 that is a surface label having one of five values, each corresponding to one of the five surfaces (M, O, D, B, L) of a tooth. Accordingly, each training data entry may include an image 2604 and labels 2606-2610 as inputs. The desired output for each training data entry may be a surface label indicating the surface (M, O, D, B, L) on which the caries indicated in the label 2608 are formed. The training algorithm may therefore train the encoder 2602 to output a surface label for caries for a given input image 2604 and corresponding labels 2606-2610 corresponding to those caries.

FIG. 27 is a schematic block diagram of a system 2700 for selecting dental treatments in accordance with an embodiment of the present invention. Dental treatments may include such treatments as a crown, restoration (e.g., filling), monitoring, preventative care, root canal therapy, scaling and root planing per tooth or by oral quadrant, extraction, orthodontic treatment addressing malocclusion, oral surgical intervention, and prosthodontic treatment, and root canal therapy. The system 2700 may also be used for selecting orthodontic treatments such as described in U.S. Provisional Application Ser. No. 62/916,966 filed Oct. 18, 2019, and entitled Systems and Methods for Automated Orthodontic Risk Assessment, Medical Necessity Determination, and Treatment Course Prediction.

The system 2700 may include an encoder network 2702. The encoder network 2702 may include a number of multi-scale stages with downsampling between them with the last stage coupled to a fully connected layer. The encoder network 2702 may be implemented according to any of the approaches described above for implementing a CNN. Other machine learning approaches may also be used, such as random forest, gradient boosting, or support vector machine.

Training data entries may each include an image 2704, such as an image of dental anatomy according to any of the imaging modalities described herein. Each training data entry may further include a tooth label 2706 (pixel mask indicating portion of image 2604 representing a tooth), caries label 2708 (pixel mask indicating portions of the image 2704 corresponding to one or more caries on the tooth indicated by the label 2706), and a restoration label 2710 (pixel mask indicating portions of the image 2704 representing any prior restoration performed with respect to the tooth indicated by the tooth label 2706)). In this manner, additional treatments needed to fix a prior restoration may be identified.

The image 2704 and labels 2706-2710 may be concatenated and processed using the encoder 2702. The encoder 2702 then generates an output 2712 that is a treatment estimate, e.g. a numerical value corresponding to a treatment. Accordingly, each training data entry may include an image 2704 and labels 2706-2710 as inputs. The desired output for each training data entry may be a treatment option, e.g. the numerical value corresponding to the appropriate treatment option for the caries indicated by the label 2708. The training algorithm may therefore train the encoder 2702 to output a treatment estimate for a given input image 2704 and corresponding labels 2706-2710.

FIG. 28 is a schematic block diagram of a system 2800 for selecting a diagnosis, treatment, or patient match in accordance with an embodiment of the present invention. In particular, treatments may include a selection of a treatments for caries based on the extent and depth of the caries. Such treatments may include a filling, multiple fillings, a crown, restoration, monitoring, preventative care, root canal therapy, or extraction. As another example, the dental pathology may include endodontic disease, e.g., carious lesions in bone such that a treatment may include tooth extraction. In another example, the presence of decay in bone around a tooth may be used to determine whether to do a crown, root canal, or extraction. In yet another example, decay around a previous restoration (e.g., filling or crown) or treatment (e.g., root canal therapy) may be used to determine an appropriate additional treatment such as root canal therapy, extraction, or additional root canal therapy. The system 2800 may also be used for diagnosing orthodontic conditions and selecting orthodontic treatments such as described in U.S. Provisional Application Ser. No. 62/916,966 filed Oct. 18, 2019, and entitled Systems and Methods for Automated Orthodontic Risk Assessment, Medical Necessity Determination, and Treatment Course Prediction.

The system 2800 may include an anatomy identification machine learning model 2802, which may be embodied by a CNN, such as an encoder-decoder CNN according to any of the embodiments disclosed herein. The machine learning model 2802 may also be implemented using other machine learning approaches such as such as random forest, gradient boosting, or support vector machine.

The machine learning model 2802 takes as inputs an image 2804, which may be an image corrected according to any of the approaches described herein (reoriented, decontaminated, transformed, inpainted). The machine learning model 2802 may further take as an input one or more anatomical masks 2806 for the image 2804. The anatomical masks 2806 may be pixels masks labeling anatomy represented in the image 2804. The anatomical masks 2806 may identify any of the dental anatomy described herein, such as teeth, CEJ, GM, JE, bony points, caries, periapical line, or other dental anatomy. The anatomical masks 2806 may label dental pathologies such as caries, carious lesion in bone, or other dental pathologies. The anatomical masks 2806 may label previous restorations such as fillings, crowns, root canal therapy, or other restorations. The anatomical masks 2806 may be generated by a trained dental professional or generated using a machine learning model trained and utilized as described herein. Images 2804 and corresponding anatomical masks 2806 may be generated and stored in a database for later processing using the machine learning model 2802 or other machine learning models described herein.

The image 2804 and the one or more anatomical masks 2806 may be concatenated and processed using the machine learning model 2802. The machine learning model 2802 may be trained to output measurements 2808 of the anatomy labeled by the masks. Accordingly, training data entries may each include an image 2804 and one or more anatomical masks 2806 as inputs and one or more measurements as desired outputs. The training algorithm may then train the machine learning model 2802 to output a measurement for a given input image 2804 and corresponding anatomical masks 2806.

The machine learning model 2802 may be multiple models, each being trained to output a particular measurement or group of measurements. The measurements of an item of anatomy may include its center of mass, relative distance to other anatomy, size distortion, and density. Measurements for caries may include volume, area, distance to pulp, percent of tooth covered by it, distance into dentin, involved surfaces of the tooth (M, O, D, B, L), and identifier of the affected tooth. Measurements of fillings or other restorations on teeth may include volume, area, percent of tooth covered by it, involved surfaces of the tooth (M, 0, D, B, L), material, type, and identifier of the affected tooth. Measurements of periodontal anatomy may include distal gingival margin, mesial gingival margin, distal CAL, mesial CAL, distal PD, mesial PD, distal bone level, mesial bone level, and the identifier of the tooth for which the periodontal anatomy is identified and measured. Measurements relating to root canal therapy at a given tooth position may include crown-to-root-ratio, calculus, root length, relative distance to adjacent teeth, furcation, fracture, and whether the tooth at that tooth position is missing.

The measurements 2808 may then be processed by a machine learning model 2810 to perform one or more tasks such as obtaining a diagnosis, determining an appropriate treatment, or identifying a patient that matches the measurements 2808. Identifying a matching patient may be helpful in claim adjudication to determine how a claim involving a similar patient was decided.

In some embodiments, the machine learning model 2810 is a dense neural network including two layers. In some embodiments, the first layer has 1000 parameters and the second network has 100 parameters. The head of the network (core model 2812) may be separate from the rest of the network (task models 2814) and trained separately. Data may be processed by the core model 2812 followed by the output of the core model 2812 being processed by the task models 2814, each task model 2814 outputting an estimate 2816 corresponding to the task it is being trained to perform.

For example, the machine learning model 2810 may be trained according to a multitask training algorithm. The training algorithm may proceed as follows:

(Step 1) The core model 2812 and a first task model 2814 are trained to perform the task corresponding to the first task model 2814 (treatment identification in the illustrated embodiment).

(Step 2) The other task models 2814 are trained to perform their corresponding tasks one at a time without changing the core model 2812 (diagnosis determination and patient matching models 2814 in the illustrated embodiment).

(Step 3) Each of the task models 2814 is trained individually again except that the training at this step includes further training of the core model 2812.

(Step 4) The core model 2814 is trained to perform the tasks corresponding to each of the task models 184 in combination with the task models 2814 except that only the core model 2812 is modified and the task models 2814 are maintained fixed. Step 4 may include processing data sets for each task in series. E.g., data set for task 1 is processed using the core model 2812 and the task model 2814 for task 1, the data set for task 2 is processed using the core model 2812 and the task model 2814 for task 2, and so on for each task with only the core model 2812 being modified during the training.

For the treatment identification task, the training data entries may each include an image 2804 and anatomical masks 2806 as inputs and an appropriate treatment as determined by a dental professional as a desired output. Likewise, the training data entries for diagnosis determination may each include an image 2804 and anatomical masks 2806 as inputs and an appropriate diagnosis as determined by a dental professional as a desired output. For patient matching, training data entries may each include an image 2804 and anatomical masks 2806 as inputs and a vector or matrix of characterizing values as a desired output. Accordingly, the core model 2812 and task model 2814 for the patient matching tasks may function as an autoencoder. The vector or matrix of characterizing values being such that they may be compared to a database of patient records to identify another patient that has a similar vector or matrix. Similarity may be measured using cosign difference measurements or other approach.

Once trained, the system 2800 may be used to evaluated the impact of perturbations to anatomical masks on the output of the machine learning model 2812. Specifically, one or more masks 2806 for an image 2804 may be perturbed according to a first perturbation style (e.g., as defined by a perturbation matrix or a perturbation value processed by a perturbation algorithm to modify the mask 2806). The image 2804 and masks 2806 having one or more masks replaced with the perturbed masks may be processed using the machine learning model 2802 to obtain measurements 2808, which are then processed using machine learning model 2810 to obtain first outputs for one or more tasks of the machine learning model 2810.

The process of the preceding paragraph may be repeated for a second perturbation style that is different from the first perturbation style to obtain second outputs from the machine learning model 2810 for one or more tasks of the machine learning model 2810. The user may then compare the outputs for the first and second perturbations styles to determine how the perturbation style impacts diagnosis determination, treatment identification, and/or patient matching.

In some embodiments a system may include an interface that may be displayed to a user and include user interface elements enabling the user to adjust perturbation styles, such as amount of erosion or dilation or amount of boundary roughening or smoothing to apply. The system may then generate a perturbation style corresponding to the amounts specified by the user and apply the perturbation style to an anatomical mask. The user may therefore experiment with perturbation styles and determine how they affect diagnosis determination, treatment identification, and/or patient matching.

The interface may further provide interface elements allowing the user to individually specify the amounts of perturbation for each type of anatomical mask 2806, e.g. each item of anatomy represented by one of the anatomical masks 2806. The user may therefore amplify or diminish the impact of a particular anatomical mask 2806 on the output of the machine learning model 2810. For example, a user might find that if they change the pulp, enamel, bone, gingival margin, CEJ, tooth, or caries masks, the output treatment, diagnosis, or patient match might correspond better with the user's own stylistic preferences.

In some embodiments, a perturbation style selected by a user may be input by concatenating a style matrix corresponding to the perturbation style with an inner stage of the machine learning model 2802, such as using the approach described above with respect to FIG. 24.

FIG. 29 is a schematic block diagram of a system 2900 for predicting claim adjudication according to a treatment plan in accordance with an embodiment of the present invention. The treatments for which a claim adjudication may be predicted may include any of the treatments for any of the diagnosis of a dental, periodontal, or orthodontic condition, such as any of the treatments for any of the dental, periodontal, or orthodontic condition described herein.

Determining the most appropriate care for a dental patient is often a balance between competing objectives. A patient might present anatomy necessitating aggressive intervention, but the patient's dental insurance plan might only cover a less invasive procedure. To allocate clinical resources efficiently, it is often useful to know how a procedure will be adjudicated by a payer network. Having clarity on payer decision making would enable a more streamlined clinical workflow. However, payer claim adjudication decisions can change from day-to-day. Also, different payers have different adjudication tendencies and timelines, which makes it very difficult for dentists to determine optimal patient care.

To solve this problem, an automated treatment likelihood system 2900 may be trained and used to predict payer decisions with respect to a particular treatment. The system 2900 may include an anatomy identification machine learning model 2802, which may be embodied by a CNN, such as an encoder-decoder CNN according to any of the embodiments disclosed herein. The machine learning model 2902 may also be implemented using other machine learning approaches such as such as random forest, gradient boosting, or support vector machine.

The machine learning model 2802 takes as inputs an image 2904, which may be an image corrected according to any of the approaches described herein (reoriented, decontaminated, transformed, inpainted). In some embodiments, anatomical masks as described above with respect to the system 2800 are omitted. However, in other embodiments, the input to the machine learning model 2902 may include the image 2904 concatenated with one or more anatomical masks 2905.

The machine learning model 2902 may be trained to output measurements 2906 of anatomy represented in the image 2904 and possibly the anatomical masks 2905 for the image 2904. The measurements may include some or all of the measurements described above as being output by the machine learning model 2802. The machine learning model 2902 may be trained in the manner described above with respect to the machine learning model 2802.

The measurements 2906 may be combined with one or more items of metadata 2908 relating to the patient whose anatomy is represented in the image 2904. The metadata may be in text form and may be extracted from patient records, such as clinical notes in patient records. The metadata may include such information as age, comorbidities, past treatments, past diagnosis, past periodontal chart, past odontogram, geography, medications, other text notes, and past claims. The measurements 2906 may also be combined with an identifier 2910 of a payer for which treatment likelihood is to be estimated.

The measurements 2906, metadata 2908, and payer identifier 2910 may be concatenated and input to a machine learning model 2912. The machine learning model may be trained to perform various tasks with respect to the input data. The tasks may include treatment identification, diagnosis determination, and patient match identification as described above with respect to the system 2800. An additional task may include claim adjudication, e.g., a likelihood that a treatment identified will be approved or disapproved by the entity identified by the payer identifier 2910.

Accordingly, training data entries for the machine learning model 2912 may include measurements 2906, metadata 2908, and a payer identifier 2910 as inputs and as a desired output some or all of a treatment identification, diagnosis determination, patient match identification, and a claim adjudication. The claim adjudication may be binary (approved/disapproved) and/or a time value, e.g. an amount of time required before approval. The training algorithm may then train the machine learning model 2912 to perform the tasks using the training data entries. The training algorithm may include performing the multitask training algorithm described above with respect to the machine learning model 2810. The machine learning model 2912 may include a core model and task model for each tasks using the approach described above with respect to the machine learning model 2810.

The machine learning model 2912 may be implemented as a neural network comprised of two dense layers, such as a fully connected network. The number of parameters in each layer may vary depending on the type of imaging modality and anatomical location. Feature distillation may be conducted prior to final training. The final output size may be variable depending on whether the model 2912 is predicting treatment (Tx), diagnosis (Dx), closest historical patient match, or claims adjudication. The fully connected network may be replaced other with machine learning algorithms such a tree-based techniques, gradient boosting, and support vector machines. The alternative machine learning algorithms may also be used in an ensemble method.

Following training, an image 2904 of a patient, and possibly anatomical masks 2905 for the image 2904 may be processed using the machine learning model 2902 to obtain measurements. Measurements 2906, metadata 2908 for the patient, and a payer identifier 2910 may then be processed using the machine learning model 2912 to obtain some or all of a treatment identification, diagnosis determination, closest patient match, or a predicted claim adjudication. In some embodiments, the predicted claim adjudication may include a predicted time before approval.

As for the system 2800, the system 2900 may include an interface that may be displayed to a user and include user interface elements enabling the user to adjust perturbation styles, such as amount of erosion or dilation or amount of boundary roughening or smoothing to apply. The system may then generate a perturbation style corresponding to the amounts specified by the user and apply the perturbation style to an image. The user may therefore experiment with perturbation styles and determine how they affect diagnosis determination, treatment identification, patient matching, or claim adjudication.

The interface may further provide interface elements allowing the user to individually specify the amounts of perturbation for each anatomical mask 2905. The user may therefore amplify or diminish the impact of a particular anatomical mask 2905 on the output of the machine learning models 2902, 2912. For example, a user might find that if they change the pulp, enamel, bone, gingival margin, CEJ, tooth, or caries detection output then the treatment, diagnostic, patient match, or claim adjudication results might correspond better with their own stylistic preferences.

Likewise, on a larger scale, a large number of patient data entries each including an image 2904, anatomical masks 2905, patient metadata 2908, and payer identifier 2910 may be subject to a common perturbation style of one or more masks 2905 to obtain claim adjudication predictions that may be aggregated (e.g., averaged or summed). This may be performed multiple times with different perturbation styles for different types of masks 2905. A user may therefore estimate how a change in the perturbation style of a mask 2905 of a particular anatomical feature could affect claim adjudications in aggregate. The user is thereby enabled to determine how perturbations to a mask 2905 of a particular anatomical feature affects risk of the payer or other party.

In some embodiments, a perturbation style selected by a user may be input to the system 2900 by concatenating a style matrix corresponding to the perturbation style with an inner stage of the machine learning model 2802, such as using the approach described above with respect to FIG. 24.

Referring to FIG. 30, in some embodiments, a system 3000 may be used to determine a likelihood of a treatment being appropriate. The treatments for which likelihood of treatment may be predicted may include any of the treatments for any of the diagnosis of a dental, periodontal, or orthodontic condition, such as any of the treatments for any of the dental, periodontal, or orthodontic condition described herein.

The system 3000 may include a two-layer bi-directional long short-term memory (LSTM) network 3002. The LSTM network 3002 takes as inputs the outputs of machine learning models 2900 a-2900 d. Although four machine learning models 2900 a-2900 d are shown, the approach described herein may be used with any number of machine learning models 2900 a-2900 d greater than two. The machine learning models 2900 a-2900 d may be implemented as a system 2900 as described above except that one or more of the last layers of the machine learning model 2912 are removed and the outputs of the last remaining layer are then input to the LSTM network 3002.

The machine learning models 2900 a-2900 c each take as inputs patient data at for a dental appointment preceding a current claim for which adjudication is being predicted. The patient data for an appointment may include any of the data described above as being input to the machine learning model 2902, such as an image captured during the appointment, anatomic labels for the image, patient metadata as constituted at the time of the appointment. The machine learning model 2900 d takes as input the same items of patient data from an appointment for which the likelihood of a treatment is to be determined using the system 3000.

The LTSM network 3002 may be trained with historical patient data to output a treatment likelihood 3006. In some embodiments, the treatment likelihood 3006 may be an estimate of approval of payment for a treatment by a payer. Accordingly, an input to the LTSM network 3002 may be a payer identifier 3004. Accordingly, a training data entry for training the system 3000 may include the patient data for a plurality of appointments (e.g. a number of appointments equal to the number of machine learning models 2900 a-2900 d) as an inputs and a treatment approved or denied for the last appointment in the set of appointments as a desired output. Each training data entry may further include a payer identifier 3004 for the payer that approved or denied the treatment. The LTSM network 3002 may then be trained by inputting the patient data for each appointment into one of the machine learning models 2900 a-2900 d. In some embodiments, temporal ordering is preserved, e.g. machine learning model 2900 a receives patient data for the earliest appointment, machine learning model 2900 b for the next appointment, and so on to the last machine learning model 2900 d which receives the patient data for the most recent appointment. The outputs of the machine learning models 2900 a-2900 d are processed using the LSTM network 3002 to obtain a treatment likelihood 3006. The training algorithm then compares a treatment likelihood 3006 output by the LSTM network 3002 to the treatment approved or denied as recorded the training data entry and updates the LSTM network 3002 according to whether the treatment likelihood matches the treatment approved or denied as recorded in the training data entry.

In use, patient data for a set of appointments may then be input to the machine learning models 2900 a-2900 d as described above and the outputs of the machine learning models 2900 a-2900 d input to the LSTM network 3002 (possibly with a payment identifier 3004) to obtain a treatment likelihood 3006.

Various alternative embodiments are also possible. For example, in some cases there may be records of some or all of an actual diagnosis, treatment, and claim adjudication for prior appointments. This data along with other patient data (e.g., image, anatomical labels, or anatomy measurements) may be referred to as an appointment data set. The LTSM network 3002 may define inputs for a plurality of appointment data sets, with the input for the most recent appointment taking only patient data without data defining a claim adjudication. The LTSM network 3002 may then be trained to determine a treatment likelihood, which may be a claim adjudication likelihood, or the last appointment.

As for other embodiments disclosed herein, an interface may be provided to evaluate the impact of perturbations to anatomical labeling on the treatment likelihood 3006. Perturbations for an anatomical label type as input by a user may be implemented with respect to the machine learning models 2900 a-2900 d as described above with respect to the system 2900. This may include evaluating a financial implication of perturbations on an aggregation of treatment likelihoods for patient data from a large (e.g., 100 s or 1000 s) set of patients.

Referring to FIG. 31, for various reasons, it is often useful to annotate dental images. Descriptive text information is often used for diagnostic communication or insurance claims adjudication, such as the extent of disease, disease characteristics, disease location, disease progression, or ongoing past dental treatments. FIG. 31 illustrates a system and method for automatically generating clinically useful annotations relating to dental images, past dental treatments, patient metadata, geographical information, image acquisition error, and dental disease progression. The approach of FIG. 31 may be used to enable image to text generation based on patient images (e.g., dental bitewing images or images according to any of the imaging modalities described herein), historical information (e.g., past medical history), geographical data, and metadata (e.g., age).

It is often useful to extract semantically meaningful text-based descriptions from dental images. Dentists create verbose textual diagnostic and treatment descriptions during patient examination that aid in anatomical and physiological information ingestion, summary, and transfer. Usually dentists manually input this information into a computer interface. This process is time consuming and prone to human error.

This process may be automated using the illustrated system 3100 including a semantically meaningful text generator. The generator translates an input image 3102 into diagnostic predictions, e.g., “healthy with attachment loss on an individual site,” or “carious lesion detected invasive into the pulp on the mesial side of tooth number 11,” or orthodontic information regarding a patient. The diagnostic predictions may include diagnosis of any of the dental and periodontal conditions described herein. The diagnostic predictions may also include a description of dental or periodontal treatment for any of the dental and periodontal conditions described herein.

The generator 3100 may include a CNN image classification model 3104 and a long-short term (LSTM) model 3106. The image classification model 3104 and LSTM model 3106 may be trained separately and then trained together.

For example, the image classification model 3104 may be trained first using training data entries that each include an image 3102 as inputs. The desired output of each training data entry may include a classification of the image 3102, such as a value that classifies an item of anatomy, a pathology, treatment, or restoration represented in the image 3102. An item of anatomy may include any of teeth, bone, pulp, dentin, caries, height of contour, enamel, calculus, cementum enamel junction (CEJ), and the gingival margin. The location of each item of anatomy represented may also be encoded in the classification. The classification of a training data entry may also include a value classifying treatments such as restorations, crowns, root canal therapy, or other treatments that correspond to the image 3102 and possibly classifying a location of the treatment on the anatomy of the patient represented in the image 3102.

Accordingly, the classification model 3104 may be trained by a training algorithm to output a correct classification for an input image 3102 that classifies an item of anatomy and a pathology or treatment represented in the image 3102.

In the illustrated embodiment, the classification model 3104 includes seven multi-scale stages 3114 followed by two fully connected layers 3116 a, 3116 b, the final fully connected layer 3116 b outputting the classification 3108. Each multi-scale stage 3114 may contain three 3×3 convolutional layers, paired with batchnormalization and leaky rectified linear units (LeakyReLU). The first and last convolutional layers of each stage may be concatenated via dense connections, which help reduce redundancy within the classification model 3104 by propagating shallow information to deeper parts of the network. Each multi-scale stage 3114 may be downscaled by a factor of two at the end of each multi-scale level by convolutional downsampling with stride 2. In the illustrated embodiment, third and fifth multi-scale stages 3114 are passed through attention gates 3118 a, 3118 b, respectively, before being concatenated with the first fully connected layer 3116 a. The gating signal applied to the output of the third stage 3114 by attention gate 3118 a may be derived from the fifth stage 3114. The gating signal applied to the output of the fifth stage 3114 by attention gate 3118 b may be derived from the seventh stage 3114. Not all regions of the image are relevant for predicting anatomy, so attention gates 3118 a, 3118 b may be used to selectively propagate semantically meaningful information to deeper parts of the network. Adam optimization may be used during training to automatically estimate the lower order moments and helps estimate the step size which desensitizes the training routine to the initial learning rate.

The classification model 3104 may be trained as described above by repeatedly: processing an input image of a training data entry with the classification model 3104 to obtain a classification 3108; comparing the classification 3108 to the classification of the training data entry; and modifying parameters of the classification model 3104 according to a loss function that is a function of the comparison.

Following training of the classification model 3104, the final layer may be removed, e.g. the second fully connected layer 3116 b, to obtain a second classification model 3120. The output of the final remaining layer (fully connected layer 3116 a) may then be input to the LSTM model 3106. The LSTM model 3106 includes multiple LSTM networks 3110, such as six or more LSTM networks 3110. The LSTM networks 3110 may be arranged in series such that each LSTM network 3110 takes as an input, the output of the final remaining layer and an output of any preceding LSTM network 3110.

The LSTM networks 3110, or the combination of the classification model 3120 and LSTM networks 3110, may be trained to produce textual sequences that relate to dental image, patient meta information, past medical history, image acquisition errors, and disease progression. Accordingly, training data entries for training the LSTM network 3110 may include an image 3102 as an input and, as an output, textual sequences that may be manually generated by licensed dentists. The textual sequences may include text describing items of anatomy, pathologies of items of anatomy, proposed treatments for items of anatomy, and/or restorations proposed for one or more items of anatomy. Accordingly, a training algorithm may train the LSTM networks 3110 of the LSTM model 3106 to output a text sequence 3112 for a given input image 3102, the text sequence including text describing items of anatomy, pathologies of items of anatomy, proposed treatments for items of anatomy, and/or restorations proposed for one or more items of anatomy.

Training data entries for training the classification models 3104, 3120 and the LSTM model 3106 may be augmented. For example, first training data entries may include images 3102 that have been labeled with a classification as described above for training the classification model 3104 and/or have been labeled with a textual sequence. These first training data entries may be used to obtain augmented training data entries each including a modified version of an image 3102 from the first training data entries with the same classification and/or textual sequence label, the modified version being obtained by performing a transformation on the image 3102 such as rotation, deformation, skewing, translating, increasing size, decreasing size, adding noise, intensity rescaling, or other transformation.

In some embodiments, the transformation may include removing features from the image 3102 to obtain the modified image, such as representations of one or more teeth, caries, endodontic lesions, fillings, crowns, bridge, implants, or other restorations. A GAN may be trained to perform this transformation using training data entries including an image as an input and a modified image having a feature removed as a desired output, the modified image being human generated. The GAN may include a discriminator trained to take as an input a synthetic image from a generator of the GAN and an unpaired real image and attempt to detect which is fake. Accordingly, the loss function used to train the generator may be a function of similarity to a synthetic image generated by the generator for an input image and the modified image for that input image and as a function of the output of the discriminator. Accordingly, the generator is trained by a training algorithm to output a synthetic image that is indistinguishable from a real image by the discriminator and that matches the modified image. During utilization, the generator is used to generate modified images lacking one or more items from input images in order to obtain augmented training data entries.

The classification model 3104, 3120 and LSTM model 3106 may therefore be trained using the first training data entries and augmented training data entries in order to be robust to noise and imaging errors.

The data input to the LSTM networks 3110 may be further augmented with other items of information such as semantically segmented anatomical labels of anatomy represented in an input image 3102. These labels may be manually generated or generated according to a machine learning model, such as any of the machine learning models described herein for labeling dental and periodontal anatomy and pathologies. Data augmentation may be conducted by automatically generated distances from and relationships to semantically segmented anatomy. In particular, any of the measurements of anatomy and pathologies (caries, pockets, and the like) described herein may be used as augmented information input to the LSTM model 3106.

Various modifications may be made to the illustrated system 3100. For example, the classification model 3120 may be replaced with a modified encoder. For example, a generator of a GAN according to any of the approaches described above for generating anatomy labels may be trained as described above. As described above, the generator may include an encoder and a decoder. The generator following training may be modified by removing the decoder portion and possibly one or more final layers of the encoder to obtain a modified encoder. The output of the final remaining layer of the modified encoder, which will typically be a two- or three-dimensional matrix of values may then be input to the LSTM model 3106.

The LSTM model 3106 may be trained as described above by repeatedly: processing an input image of a training data entry with the modified encoder (e.g., classification model 3120 or a modified encoder from a GAN as described above); inputting the output of the modified encoder resulting from the processing to the LSTM model 3106; receiving a text sequence output of the LSTM model 3106 as a result processing the output of the modified encoder; comparing the text sequence to the text sequence of the training data entry; and modifying the LSTM model 3106, and possibly the modified encoder, by the training algorithm according to a loss function that is a function of the comparison.

Note that there may be multiple modified encoders, each being the result of training a generator to generate a label (e.g., pixel mask) for a different item of anatomy or a pathology. Accordingly, the input to the LSTM model 3106 may be outputs of multiple modified encoders concatenated with one another.

Referring to FIG. 32A, patient identification from dental images is important in ensuring correct patient correspondence between clinical findings, patient meta information, and treatment course. Patient mismatch could be detrimental to a provider's reputation and severely compromise patient safety. FIG. 32A illustrates a system 3200 a for identifying dental images that originate from the same patient or different patients through the entire life cycle of the patient's dental history. In particular, as described herein, an image may be classified as some or all of belonging to a particular patient, belonging to a particular study of a particular patient (e.g., images captured at or around the same time, such as on the same day, within the same week, or some other time period), or being a particular view (e.g., which sequence of the FMX series the image corresponds to). These classifications are referred to herein as patient identification (ID), study ID, and image view ID, respectively.

The system 3200 a may take as inputs a dental image 3204, such as a raw dental image or a dental image corrected or modified according to any of the embodiments described herein. The system 3200 a may further take as inputs one or more labels (e.g., pixel masks) of one or more items of dental anatomy, pathologies, or restorations, such as any of the anatomy, pathologies, defects, and restorations described herein. In the illustrated embodiments, these labels include teeth labels 3206, caries labels 3208, restoration labels 3210, and one or more other anatomy labels 3212 (e.g., GM, CEJ, or other anatomy).

The system 3200 a may include a CNN 3202 that is used to process the inputs. For example, the inputs may be concatenated and input to the CNN 3202. In the illustrated embodiment, the CNN 3202 includes eight multi-scale stages 3214 which may have three layers of 3×3 convolutional kernels that may be coupled with ReLU, and batchnormalization. The inputs 3204-3212 may each be an input channel to the CNN 3202. In some embodiments, the binary masks that constitute labels of anatomy, pathologies and/or restorations may be propagated to deeper portions of the CNN 3202 with skip connections to help reduce redundancy. The output of the last stage 3214 of the network may be input to two fully connected layers 3216 a, 3216 b coupled in series. The last fully connected layer 3216 b may produce an output 3218 that includes some or all of a patient ID, study ID, and image view ID.

Training data entries used by a training algorithm to train the CNN 3202 may include the input image 3204 and possibly one or more other labels 3206-3212. The output for each training data entry may include a patient ID, study ID, and image view ID. Accordingly, the CNN 3202 is trained by a training algorithm using the training data entries to output a patient ID, study ID, and image view ID for each an input image 3204 and one or more labels 3206-3212. Categorical cross entropy is used to update parameters of the CNN 3202.

For example, training may include repeatedly performing: processing an image 3204 and one or more other labels 3206-3212 from a training data entry with the CNN 3202 to obtain an estimated patient ID, study ID, and image view ID; comparing the estimated patient ID, study ID, and image view ID to the patient ID, study ID, and image view ID of the training data entry; and updating parameters of the CNN 3202 according to a loss function that is a function of the comparing.

The training data entries may include augmented training data entries generated as described above by modifying an original image of an original training data entry by any of the above-described transformations. The modified images of the augmented training data entries may each be automatically labeled with one more other labels 3206-3212, such as using the machine-learning approaches for labeling images as described above. The output for each augmented training data entry will be the output (patient ID, study ID, image view ID) for the original training data entry from which it was obtained.

Referring to FIG. 32B, following training, the final layer may be removed, e.g., the second fully connected layer 3216 b, to obtain a modified CNN 3220 of the illustrated system 3200 b. The output of the modified CNN 3220 may be a feature vector or matrix of values 3222. The values 3222 are hidden values that were used by the second fully connected layer 3216 to obtain the patient ID, study ID, and image view ID. Accordingly, the values 3222 are values that encode sufficient information to distinguish the images from a patient, study, and image view from images of a different patient, study, and/or image view.

Accordingly, a new image 3204 and its corresponding labels 3206-3212 may be processed using the CNN 3220 to obtain values 3222 that encode the input data and can be used for matching. The new image 3204 and its corresponding labels 3206-3212 may or may not be one of the images 3204 used to train the CNN 3202.

Images in a repository may each be processed using the CNN 3202 to obtain values 3222 b from the fully connected layer 3216 a. The values 3222 b of a first image may be compared to the values 3222 b of as second image to see if the first and second images match. The similarity between two sets of values 3222 b may be calculated using cosine distance, root mean square (RMS), Euclidian distance, or any other approach for comparing two vectors.

In some embodiments, the number of values 3222 b may be quite large, e.g. 248 values. It may be prohibitively complex to compare 248 values for each image in a repository of images numbering in the hundreds of thousands or millions. Accordingly, in some embodiments, various versions of the CNN 3220 may be generated, specifically with different numbers of outputs of the fully connected layer 3216 a. For example, various versions of the CNN 3202 may be trained as described above, each with a different number of outputs of the first fully connected layer 3216 a, e.g. 10, 100, and 248. Accordingly, the second fully connected layer 3216 b is removed from each of these CNNs 3202 to obtain a set of CNNs 3220.

Images with their corresponding labels may then be processed using each CNN 3220 to obtain multiple (three in this example) sets of values 3222 b, one set with 10, one set with 100, and one set with 248. Accordingly, to identify matching images, the smallest sets of values 3222 b of all images are compared to identify a first subset of images having a similarity (cosine distance, Euclidian distance, RMS, etc.) meeting a first threshold. The second smallest sets of values 3222 b for the images of the first subset of images may be compared to one another to identify a second subset of images having similarity meeting a second threshold that may be the same as or different from the first threshold. The largest sets of values 3222 b for the second subset of images may then be compared to one another to identify a third subset of images having similarity meeting a third threshold that may be the same as or different from the second threshold. This process may be repeated for any number of sets of values 3222 b in order to improve computational efficiency. The subset of images meeting a predefined similarity threshold for the largest set of values 3222 b may be deemed to be images corresponding to some or all of the same patient ID, study ID, and/or image view ID. Alternatively, an image is only deemed to be match for another image having the closest similarity (e.g., smallest distance by any of the above-referenced metrics) relative to other images.

Referring to FIG. 32C, in another system 3200 c, a pair of machine learning models 3220 a, 3220 b may be used, such as two CNNs 3220 a, 3220 b. The machine learning models 3220 a, 3220 b may have the same structure as the CNN 3220 as described above and may be pretrained as described above for the CNN 3220 or may be exclusively trained using the approach described below. Each machine learning model 3220 a, 3220 b takes as inputs an image 3204 a, 3204 b, respectively, each with one or more corresponding labels 3206 a-3212 a, 3206 b-3212 b.

The inputs are processed using each machine learning model 3220 a, 3220 b to obtain two sets of values 3222 a, 3222 b characterizing the inputs. These inputs may then be compared to obtain one or more comparison values 3224. In some embodiments, there may be three layers or channels in the values 3222 a, 3222 b each corresponding to one of the patient ID, study ID, and image view ID. The machine learning models 3220 a, 3220 b may be trained according to the comparison. For example, if the pair of images 3204 a, 3204 b are labeled with the same patient ID, the comparison value 3224 for patient ID should indicate this similarity, e.g. a higher value indicating higher probability of a match. Similarly, if the pair of images 3204 a, 3204 b are labeled with the same study ID, the comparison value 3224 for study ID should indicate this similarity, e.g. a higher value indicating higher probability of a match. If the pair of images 3204 a, 3204 b are labeled with the same image view ID, the comparison value 3224 for image view ID should indicate this similarity, e.g. a higher value indicating higher probability of a match. In a like manner, input images that are not for the same identifier (patient ID, study ID, or image view ID) should have dissimilar (e.g., closer to 0) comparison values 3224 for that identifier.

A training algorithm may therefore train the models 3220 a, 3220 b to output the correct comparison value 3224 for a given pair of input images 3204 a, 3204 b and corresponding labels for each identifier (patient ID, study ID, image view ID). The models 3220 a, 3220 b may be trained independently or may be maintained identical, i.e. weights of each model 3220 a, 3220 b modified in the same manner at each iteration of the training algorithm.

In some instances, one input image 3204 a is an original image and the other image 3204 b is obtained by modifying the input image 3204 b using any of the transformations described above for generating augmented training data. Labels 3206 b-3212 b of the modified image may be generated automatically using the automatic labeling approach described above. In such instances, the comparison values 3224 for each identifier should indicate identicality and the training algorithm may train the machine learning models 3220 a, 3220 b accordingly. In other instances, there is no relationship between the images 3204 a, 3204 b and their corresponding labels such that the comparison values 3224 for each identifier should indicate this fact and the training algorithm may train the machine learning models 3220 a, 3220 b accordingly.

Referring to FIG. 32D, the illustrated system 3200 d may include a CNN 3220 that may be structured as the CNN 3220 described above. The CNN 3220 may be pretrained as described above with respect to FIG. 32B or may be trained exclusively using the approach described below with respect to FIG. 32D. The approach of FIG. 32D makes use of triplet loss to train the CNN 3220.

Training data entries for training the CNN 3220 may be the same as described above except for training data entries may include a group of three images 3204, each with one or more corresponding labels 3206-3212. Each group of three images may include a first image, a second image that is a transformed version (such as any of the transformations described above for generating augmented data), and a third image that is unrelated to the first image (different patient ID, different study ID, and/or different image view ID).

The values 322 output by the CNN 3220 may include three output channels or group of values each channel or group of values corresponding to an identifier (patient ID, study ID, image view ID). The loss function may be evaluated with respect to three sets 3226 a, 3226 b, 3226 c of data each corresponding to one of the identifiers (patient ID, study ID, and image view ID. Each set 3226 a, 3226 a, 3226 c includes values 3222 for all three images.

For example, set 3226 a includes values 3222 for the patient ID channel obtained using the CNN 3220 for the first image, second image, and third image. The set 3226 b includes values 3222 for the study ID channel obtained using the CNN 3220 for the first image, second image, and third image. The set 3226 c includes values 3222 for the image view ID channel obtained using the CNN 3220 for the first image, second image, and third image.

The training algorithm may evaluate the differences in the values 3222 for the three images in each set 3226 a, 3226 b, 3226 c and adjust parameters of the CNN 3220 in order to output an accurate result. For example, the accurate result may be that in each set 3226 a, 3226 a, 3226 c, the values 3222 for the first image are identical to the values 3222 for the second image, and the values 3222 for the third image are different from the values 3222 for the first image and the second image. Degree of similarity and difference may be measured using any of the distance metrics described herein above (cosine, Euclidian, RMS).

Referring to FIG. 33, the illustrated system 3300 may be used to train an encoder 3302 that may be used to generate output vectors 3304 that encode an image and may be used for comparing images. The encoder 3302 may be embodied as a CNN or any other machine learning model. The encoder 3302 may be implemented according to any of the encoders or classification networks described herein.

The system 3300 further includes a GAN including a generator 3306 (embodied as a decoder in the illustrated embodiment) and a discriminator 3308. The generator 3306 and discriminator 3308 may be structured according to any of the approaches for implementing a GAN as described herein except that the generator 3306 includes only the decoder portion of the generator. For example, the generator 3306 may include a fully connected layer that receives an input vector 3310 and is coupled to a number, e.g., eight, de-convolutional multi-scale CNN stages that may include two 4×4 convolutional layers at each multi-scale stage.

The input a vector 3310 may be a vector of 100 or more values. The input vector 3310 is processed using the generator 3306 to output a synthetic image 3312. The synthetic image 3312 and a real image 3314 from a repository are processed using the discriminator 3308, which outputs a realism matrix 3316, each value of the realism matrix 3316 being an estimate of which of the images 3312, 3314 is fake. The real images 3314 may be images of dental anatomy according to any of the imaging modalities described herein.

A training algorithm evaluates loss functions that are a function of the realism matrix to train the generator 3306 and discriminator 3308. The training algorithm updates parameters of the generator 3306 to train the generator 3306 to generate synthetic images 3312 that are not detectable as fake by the discriminator 3308 from the real images 3314. The training algorithm updates the discriminator to correctly identify the synthetic images 3312 as fake.

The synthetic images 3312 are processed using the encoder 3302 to obtain an output vector 3304, which may have the same number of elements as the input vector 3310. The loss function for training the encoder 3302 may be a function of similarity of the input vector 3310 to the output vector 3304. The training algorithm updates parameters of the encoder 3302 to train the encoder to output an output vector 3304 that is similar, if not identical, to the input vector 3310. During training, the input vectors 3310 may be randomly generated vectors of values. The randomly generated vectors 3310 may be stochastically distributed over a space of possible values for the vectors 3310.

As is apparent, the encoder 3302 is trained to relate an image to an arbitrary vector of values. During utilization, the generator 3306 and discriminator 3308 are discarded or not used. A first vector of values obtained by processing a first image using the encoder 3302 may be compared to a second vector of values obtained by processing a second image using the encoder 3302. Similarity of the first and second vectors, such as using any of the distance metrics described above (cosine, Euclidian, RMS) may therefore be used to estimate whether the first and second images are images of the same patient, i.e. same patient ID. A repository of images may be processed using the encoder 3302 in order to obtain vectors 3304 of values describing each image, which may then be used to determine which images are similar to one another (e.g., same patient ID, same study ID, and/or same image view ID).

Various modifications to the approach of FIG. 33 may be used. For example, rather than training the generator 3306 to generate just synthetic images 3312, the generator 3306 may be trained to generate images 3312 and anatomy labels for the images 3312. Accordingly, inputs to the discriminator 3308 may include the synthetic image 3312 and one or more anatomy labels concatenated with one another and a real image 3314 and one or more anatomy labels of anatomy represented in the real image 3314 concatenated with one another.

Four approaches for obtaining vectors characterizing an image are described herein with respect to FIGS. 32A through 33. In some embodiments, two to four of these are used in combination. For example, for each of the two or four approaches selected, an image may be labeled with one or more vectors of values obtained by processing the image using that approach. A pair of images may then be compared by comparing multiple vectors obtained using the multiple approaches in order to obtain a measure of similarity. For example, for each approach used, a distance metric may be calculated for the one or more vectors for each image obtained using that approach. The distance metrics for the multiple approaches may then be averaged, summed, the minimum or maximum distance metric identified, or otherwise combined to obtain an overall metric of similarity.

As noted herein, one or more vectors for a first image may be compared to one or more vectors for a second image to obtain one or more distance metrics. The one or more distance metrics may be used as a cutoff criterion to determine whether two images are sufficiently similar, e.g., have the same patient ID, study ID, and or image view ID. The one or more distance metrics may also be used as a cutoff criterion to determine that two images are mismatched, e.g., do not have the same patient ID, study ID, or image view ID. This may be used as a safety check to flag potentially misclassified images.

In some embodiments, vectors for the same identifier (patient ID, study ID, and/or image view ID) may be averaged. For example, vectors for all images of the same patient may be averaged to obtain an average vector. Then, the vectors for additional images may be compared to the average vector. Those meeting a threshold similarity may be deemed to be for the same patient ID. Images for the same study ID may be identified in a similar manner. For example, images deemed to be for the same patient ID may be compared to the average vector of vectors for images having the same study ID. Those images having meeting a threshold similarity to the average vector may be deemed to belong to the same study ID.

In an alternative approach, there may be multiple images assigned to the same identifier (patient ID, study ID, and/or image view ID) and having corresponding vectors of values characterizing them according to the approaches of any of FIGS. 32A through 33. For a new image, the vector of values characterizing the new image may be calculated according to the approaches of any of FIGS. 32A through 33. Distances between the vector for the new image and all the vectors for the multiple images assigned the same identifier may be calculated. These distances may then be averaged. If the average distance is below a threshold value, the new image may be deemed to correspond to the same identifier.

Referring to FIGS. 34 through 37, training artificial intelligence systems in dentistry requires high volumes of labeled images. Since deep learning models are particularly susceptible to overfitting, many specialized personnel with specific dental knowledge are required to create appropriately large and diverse datasets. It would be advantageous to be able to automatically generate synthetic dental images in order to increase the size of a dataset. However, training a machine learning model to generate photo-realistic dental images is difficult due to the broad range of anatomical variation and the need for high resolution.

The approach of FIGS. 34 through 37 may be used to automatically generate synthetic dental images. Referring specifically to FIG. 34, a generative adversarial network (GAN) 3400 may be used. The GAN 3400 may include a generator 3402 including an autoencoder, such as a variational autoencoder (VAE) 3404 coupled to a decoder 3406. The GAN 3400 may further include a discriminator 3408, such as a PatchGAN discriminator. In the illustrated embodiment, a second discriminator 3410 may also be used. The second discriminator 3410 may be implemented as a pre-trained feature extractor 3410 used to calculate perceptual loss. The feature extractor 3410 may be a machine learning model trained to identify one or more features of dental anatomy. For example, the feature extractor may be an encoder of any of the embodiments disclosed herein for labelling teeth, CEJ, GM, CAL, caries, restorations, or any other item of dental anatomy, dental pathology, or dental restoration described hereinabove.

In the illustrated embodiment, the encoder 3404 includes a seven multi-scale stage encoder CNN that takes as an input an input image 3412. Each convolutional stage within the encoder 3404 and decoder 3406 of the networks may use 4×4 convolutions paired with batchnormalization and rectified linear unit (ReLU) activations. Convolutional downsampling may be used to downsample the output of each multi-scale stage of the encoder 3404. The output of the last stage of the encoder 3404 may be, or be converted to, a 256×2 style matrix which is fed into the decoder 3406 to control stylistic variation captured by the resulting synthetic image 3416 output by the decoder 3406 for a given input image 3412 input to the encoder 3404.

The decoder 3406 may include a seven multi-scale stage decoder network comprised of 4×4 convolutional kernels, ReLU activation, and semantic activation blocks (SAB). For example, SAB may be paired with all convolutional layers and each multi-scale stage may accept multiple semantic masks 3414. Each mask 3414 may be a pixel mask having non-zero values at pixel positions corresponding to pixels in the input image 3412 representing the feature associated with the mask. For example, a mask 3414 for a tooth number will have non-zero pixels at pixel positions of pixels representing that tooth number in the input image 3412 paired with that mask 3414 or from which the mask 3414 was generated. For each input image 3412, there may be masks 3414 for a plurality of types of dental anatomy or dental treatments that may be represented in an image 3412. For example, there may be masks for some or all of each permanent tooth number (1 through 32), each primary tooth letter (A through T), crown, bridge, gutta-percha, pin, post, buildup, calculus, sealer, cement, bracket, retainer, instrument, implant, screw, veneer, silver-point, space-maintainer, core, base, temporary-filling, medicament, framework, liner, onlay-composite, onlay-metal, onlay-ceramic, inlay-ceramic, inlay-composite, inlay-metal, filling-composite, filling-glass, filling-metal, caries, caries2, caries3. There may also be masks for GM, CEJ, bony points, or any other item of dental anatomy, such as items of dental anatomy identified using the approaches described herein above.

The semantic masks 3414 may be used between all multi-scale stages of the decoder 3406 to help the SAB learn stylistic sematic tendencies from individual masks 3414. The resulting high-resolution output channels output from the last stage of the decoder 3406 may be passed through a 1×1 convolutional layer and hyperbolic tangent activation function to produce the synthetic image 3416 based on the input image 3412 and input masks 3414 generated for features represented in the input image 3412.

At each iteration of a training algorithm, the synthetic image 3416 and an unpaired real image 3418 (i.e., not the input image 3412 and not an image of the same patient as the input image 3412) from a repository of images may be passed through one or both of the discriminators 3408, 3410. The discriminator 3408 may be a patchGAN with four convolutional layers that is trained along with the encoder 3404 and decoder 3406 of the generator 3402. The discriminator 3410 may be a five multi-scale stage deep discriminator in the illustrated embodiment. As noted above, the discriminator 3410 may be pretrained and is not further trained during training of the generator 3402 and discriminator 3408. The discriminator 3408 may output a realism matrix 3420 with each output of the realism matrix 3420 indicating which of the two input images 3416, 3418 is determined to be a real image by the discriminator 3408.

The output of the discriminator 3410 may be perceptual loss 3422. The perceptual loss 3422 may be obtained by processing the synthetic image 3416 with the discriminator 3410 and processing an unpaired real image 3418, which may be the same as or different from the image 3418 used by discriminator 3408 in the same iteration of the training algorithm. First outputs of the stages of the discriminator 3410 following processing of the synthetic image 3416 are compared to their corresponding second outputs of the stages of the discriminator 3410 following processing of the real image 3418. Stated differently, the intermediate values that are output by one stage and input to another stage are compared for the images 3416, 3418.

The result of the comparison may be a set of difference values, one difference value for each value of each output of each stage for the images 3416, 3418. For example, the output of each layer may be a two, three, or greater, dimensional matrix. Each difference value may be obtained by subtracting each value of the matrix output from each stage for one image 3416 from the same matrix output (same indexes in the two, three, or more dimensions) of the same stage for the other image 3418. Note that not all values output from all stages need be compared, but for each value that is compared, the values compared will correspond to the same point within the discriminator 3410.

This set of difference values may then be processed to obtain the perceptual loss 3422. This may include summing, summing absolute values of the difference values, calculating a root mean square (RMS) (square each individual difference value, sum the squared difference values, and take the square root of the resulting sum), weighting and summing, calculating a statistical characterization of the difference values (maximum, minimum, standard deviation, etc.), or some other value derived from the difference values.

The loss function for a given iteration of a training algorithm may therefore: increase with a number of values in the realism matrix 3420 that correctly identified the synthetic image 3416 as being a fake image; and increase with increase in the perceptual loss 3422. The training algorithm will therefore process training data entries that each include an input image 3412 and its corresponding masks 3414 using the generator 3402 and discriminators 3408, 3410 as described above and evaluate the loss function. The training algorithm will adjust parameters of the generator 3402 in order to reduce the loss function over multiple iterations of the training algorithm. The loss function of the discriminator 3408 may increase with increase in a number of values in the realism matrix 3420 that identify the synthetic image 3416 as real. The training algorithm may adjust the parameters of the discriminator 3408 to reduce the loss function of the discriminator 3408. As noted above, the discriminator 3410 may be pretrained such that it is not changed during training of the generator 3402 and the discriminator 3408.

During utilization, an input image 3412 and its corresponding input masks 3414 are processed using the generator 3402 to produce a synthetic image 3416. As described below, input masks 3414 may be synthesized such that the synthetic image 3416 either omits features present in the input image 3412 or includes features absent from the input image 3412. In this manner, a single input image 3412 may be used to generate a plurality of modified synthetic images 3416 that may then be used for training purposes.

The synthetic images 3412 and corresponding masks 3414 used for training may be obtained by using real images with the masks 3414 being labeled by licensed dentists. Because the synthetic image generator 3402 may be sensitive to training parameters and architecture, a validation set of training entries (images 3412 and masks 3414) may be used for hyperparameter testing and a final hold out test set of training data entries may be used to assess final model performance prior to deployment.

In at least one possible embodiment, the illustrated system 3400 may be implemented with respect to three-dimensional input images 3412 and masks 3414, such as a CT. In such embodiments, two dimensional (e.g., 4×4 and 1×1 convolutional kernels) may be replaced with three dimensional kernels (e.g., 4×4×4 convolutional kernels and 1×1×1 convolutional kernels).

FIG. 35 illustrates a system 3500 by which input masks are processed and combined with the output of each stage of the decoder 3406 in order to obtain a combined output that is then input to the next stage of the decoder 3406.

The system 3500 may take as inputs a set of masks 3414 and an input 3504, which is a matrix output by a previous layer of the decoder 3406. For the first stage of the decoder 3406, the input 3504 may be the output of the encoder 3404 or the system 3500 may omitted from processing the input to the first stage of the decoder 3406 such that the output of the encoder 3404 is input to the decoder 3406 without processing according to the system 3500.

The input masks 3414 may be preprocessed by a first convolution stage 3506, such as a 3×3 convolution with stride N. The value of N is selected such that at least two dimensions of the output of the convolution stage 3506 will have the same size as at least two dimensions of the input 3504. In particular, the input 3504 may be at least three dimensions, with two of the dimensions corresponding to the height and width of the input image 3412 and masks 3414, i.e. the column and row dimensions of the matrices of pixels constituting the input image 3412 and masks. The input 3504 may have a depth dimension corresponding to different layers of the input 3504 and the may not match a depth of the output of the convolution stage 3506. The output of the convolution stage 3506 may be a matrix of values having two dimensions corresponding to the two dimensions of the input image 3412 and masks 3414 and equal in size to the sizes of the input 3504 in those two dimensions. The depth of the output of the convolution stage 3506 may be equal to the number of masks 3414, two dimensional matrix along the depth dimension being a result of processing one of the masks 3414.

The output of the first convolution stage 3506 may be rectified by a rectifier stage 3508. The rectifier stage 3508 may perform a PReLU (pre-rectified linear unit) algorithm. The output of the rectifier stage 3508 may have the same dimensions as the output of the first convolution stage 3506 and may be input to two convolution stages 3510, 3512. The two convolution stages are separate but may be identically configured. For example, the convolution stages 3510, 3512 may each be a 3×3×j convolution, where j is equal to the depth of the input 3504. The output of the convolution stages may be a three dimensional matrix having a height and width corresponding to the height and width of the input 3504 and a depth j equal to the depth of the input 3504.

The output of convolution stage 3510 may be multiplied by the input 3504 to obtain a product 3514 that may be added to the output of convolution stage 3512 to obtain an output 3516, which is the output of the system 3500 that will be input to a next stage of the decoder 3406 following the stage that produced the input 3504. In some embodiments, the input 3504 is processed before the multiplication, such as by a sync batch normalization stage 3518, with the result of the sync batch normalization being multiplied by the output of convolution stage 3510 to obtain the product 3514.

During training, the parameters of the convolution stages 3506, 3510, 3512 may be adjusted by the training algorithm at some or all iterations of the training algorithm to seek reduction of the loss function (e.g., the loss function based on realism estimate and perceptual loss as described above).

FIGS. 36 and 37A to 37D illustrate an approach for using the generator 3402 to generate synthetic images. FIG. 36 illustrates an interface 3600 that may be used to receive inputs from a user, the inputs describing an omission or addition to a dental image. A computer system may display the interface 3600 and perform the actions described below in response to inputs from the interface 3600.

The interface 3600 may include display of an image 3602, such as a dental image according to any of the imaging modalities described herein. The image 3602 may have corresponding masks 3414 as described above that indicate pixels of the image 3602 corresponding to particular features. The masks 3414 may or may not be displayed or may be selectively displayed in response to an input from a user.

The interface 3600 may define an interface element 3604 that, when selected by a user, receives a selection of a drawing tool (straight line, free-form line, circle, square, or other drawing tool or a tool for rotating, panning, or scaling of a previously drawn element). After selecting a drawing tool or using a default drawing tool and a pointing device, a user may then draw a shape 3606 superimposed on the image or adjust a previously drawn shape. The manner in which shapes 3606 are generated may be according to any approach for computer drawing known in the art. In some embodiments, user inputs may be the selection of an element represented in a mask, such as a tooth, filling, caries, or other element represented by a mask 3414.

The interface 3600 may further provide an interface element 3608 enabling a user to specify a mask 3414 to which a drawn element should be applied. The interface element 3608 may list some or all masks 3414 for some or all of the dental features (e.g., anatomy and treatments as defined above) for which masks 3414 are defined. In the illustrated example, one shape 3606 corresponds to a caries and the may select the caries mask 3414 using interface element 3608 for that shape 3606. Another shape 3606 may correspond to a crown and the user may select a crown mask 3414 for that shape 3606. In another example, a user selects a tooth using a drawing tool 3604 (e.g. draws around its outline, selecting it from a graphical representation of the mask for the tooth number of the tooth, or selecting the mask 3414 for the tooth number of the tooth) and specifies that it is to be removed from the mask 3414 corresponding to that tooth number.

The user may then instruct the computer system to synthesize an image, such as by selecting user interface element 3610. In response to this instruction, the computer system processes the image 3602 and its masks 3414 (one or more of which have been modified using the interface 3600) using the generator 3402. The output of the generator 3402 will be a synthetic image 3416 generated using the one or more modified masks. As a result, representations of features added to the one or more modified masks will be present in the synthetic image 3416. Likewise, features removed from masks 3414 will be excluded from the synthetic image 3416. In particular, since the generator 3402 is trained to generate realistic images according to masks 3414 and the modified masks may be applied after each stage of the decoder 3406, the modifications will be reflected in a realistic manner in the synthetic image 3416.

Referring to FIG. 37A, the illustrated method 3700 may be used to adjust shapes 3606 input by a user in order to ensure that the shapes 3606 correspond to expected shapes for the feature represented by the mask to which the shapes 3606 are added. For example, a user may draw an arbitrary shape and mark it as corresponding to the caries mask 3414. However, naturally occurring caries tend to have a particular shape. Training a machine learning model with arbitrary shapes may not prepare the machine learning model to process real images or not be as effective at training the machine learning model. Accordingly, the method 3700 may be used to adjust shapes 3606 received from a user in order to make the shapes conform more closely to naturally occurring features.

The method 3700 may include presenting 3702 a dental image 3412 and receiving 3704 an outline of a shape 3606 on the dental image 3412. The method 3700 further includes receiving a classification of the shape, i.e. selection of a mask 3414 of the dental image 3412 to which the shape is to be applied.

The method 3700 may include evaluating 3708 the input mask with respect to a mask repository, i.e. a repository of dental images 3412, each with its corresponding masks 3414. Step 3708 may include comparing the shape 3606 to shapes present in the mask 3414 corresponding to the classification from step 3706 of each dental image 3412 evaluated, i.e. associated with the same dental anatomy or dental treatment as the modified mask. The method 3700 may include identifying 3710 an image from the repository matching the shape 3606 in the mask 3414 having the classification from step 3706 (“the matching mask”). Identifying the matching mask may be performed using any image matching approach known in the art. For example, FIG. 37B represents a different image having a caries mask 314 having a mask 3718 of a caries in a different tooth number of a different patient than for the image received at step 3702.

The method 3700 may further include fitting 3712 the shape 3606 to a shape in the matching mask 3414. Fitting 3712 may include performing steps such as isolating the shape in the matching mask 3414 corresponding closest to the shape 3606 (“the matching shape”). The matching shape may then be scaled, panned, stretched, and/or rotated to match the size shape, and orientation of the shape 3606 to obtain a fitted shape. For example, FIG. 37C illustrates a fitted shape 3720 obtained by panning, rotating, scaling, and stretching the shape 3718 in order to conform to the shape 3606.

The method 3700 may further include trimming 3714 the fitted shape 3720 according to anatomy represented in the dental image 3412 presented at step 3702. For example, where the shape 3606 is classified as a caries, the fitted shape may be trimmed by removing portions of the fitted shape that extend beyond the mask 3414 for a tooth with which a major portion of the matching shape overlaps following the fitting step 3712. For example, FIG. 37D illustrates a trimmed shape 3722 obtained by trimming the shape 3720 to lie within the outline of the tooth 3724 overlapped by the shape 3606.

Matching shapes for crowns, inlays, onlays, fillings, or other features that would normally be within the outline of a tooth may likewise be trimmed. Other features that are not bounded by the outline of a tooth may remain untrimmed or be trimmed with respect to outlines indicated in masks 3414 for other anatomy, such as bone, gums, or other anatomical features. In many instances, the realism imposed by the discriminators 3408, 3410 during training may be sufficient to keep the synthesized representation of the fitted shape has a realistic relationship to other dental anatomy in the input image 3412.

The image 3412 presented at step 3702 with masks 3414 including the trimmed shape added to the mask 3414 selected at step 3706 may then be processed 3716 with the generator 3402 to obtain a synthetic image 3416. The shape 3606 will then be represented in the synthetic image 3416 in a manner approximating a feature conforming to the trimmed shape as if captured using the imaging modality used to obtain the original image 3412.

Synthetic images 3416 obtained using the approach described above with respect to FIGS. 34 through 37 may then be used for training machine learning models according to any of the approaches described hereinabove.

Referring to FIG. 38A, it can be difficult to correctly interpret clinical findings on low-resolution dental images, such as intra-oral photos, x-rays, panoramic, or CBCT images. Sometimes the images are not sharp enough to identify dental anatomy necessary to render diagnostic or treatment decisions. Furthermore, machine learning models often rely on high resolution images. The illustrated system 3800 a may be used to solve this problem. The system 3800 a may be a super resolution generative adversarial network (GAN) 3800 a that uses adversarial loss and perceptual loss to encourage realistic high-resolution predictions. The system 3800 a takes as an input a low resolution image and produces a high resolution synthetic image that captures photo realistic fine-grained feature characteristics (high meaning higher resolution than the input, such as two or more times the resolution of the input).

The system 3800 a may include a generator 3802 including an autoencoder, such as a variational autoencoder (VAE) 3804 coupled to a decoder 3806. The system 3800 a may further include a discriminator 3808, such as a PatchGAN discriminator. In the illustrated embodiment, a second discriminator 3810 is used. The second discriminator may be implemented as a pre-trained feature extractor 3810 used to calculate perceptual loss. The feature extractor 3810 may be a machine learning model trained to identify one or more features of dental anatomy. For example, the feature extractor may be an encoder of any of the embodiments disclosed herein for labelling teeth, CEJ, GM, CAL, caries, restorations, or any other item of dental anatomy, dental pathology, or dental restoration described hereinabove.

In the illustrated embodiment, the encoder 3804 includes a four multi-scale stage encoder CNN that takes as an input an input image 3812. Each convolutional stage within the encoder 3804 and decoder 3806 of the networks may use 4×4 convolutions paired with batchnormalization and rectified linear unit (ReLU) activations. Convolutional downsampling may be used to downsample the output of each multi-scale stage of the encoder 3804. The output of the last stage of the encoder 3804 may be fed into the decoder 3806 to control stylistic variation captured by the resulting synthetic output image 3816 output by the decoder 3806 for a given input image 3812 input to the encoder 3804.

The decoder 3806 may include a five multi-scale stage decoder network comprised of 4×4 convolutional kernels, ReLU activation, and semantic activation blocks (SAB). For example, SAB may be paired with all convolutional layers and each multi-scale stage may accept multiple semantic masks 3814. The semantic masks 3814 may be masks for the input image 3812 as described above with respect to the input image 3412 masks 3414.

The semantic masks 3814 may be inserted between multi-scale stages of the decoder 3806 to help the SAB learn stylistic sematic tendencies from individual masks 3814. The manner in which semantic masks 3814 are inserted between stages may be performed as described above with respect to FIG. 35. The resulting high-resolution output channels output from the last stage of the decoder 3806 may be passed through a 1×1 convolutional layer and hyperbolic tangent activation function to produce the synthetic image 3816 based on the input image 3812 and input masks 3814 generated for features represented in the input image 3812.

As shown in FIG. 38A, the decoder 3806 may include more stages than the encoder 3804 such that the synthetic image 3816 has a higher resolution than the input image 3812 (1024×1024 vs. 256×256 in the illustrated example). The use of the masks 3814 facilitates the generation of high-resolution representations of features represented by the masks 3814 by the decoder 3806.

At each iteration of a training algorithm, the synthetic image 3816 and an unpaired real image 3818 (i.e., not the input image 3812 and not an image of the same patient as the input image 3812) from a repository of images may be passed through one or both of the discriminators 3808, 3810. In the illustrated implementation, the unpaired image 3818 and the synthetic image are only both passed through the discriminator 3808.

The discriminator 3808 may be a patchGAN with four convolutional layers that is trained along with the encoder 3804 and decoder 3806 of the generator 3802. The discriminator 3810 may be a five multi-scale stage deep discriminator in the illustrated embodiment. As noted above, the discriminator 3810 may be pretrained and is not further trained during training of the generator 3802 and discriminator 3808. The discriminator 3808 may output a realism matrix 3820 with each output of the realism matrix 3820 indicating which of the two input images 3816, 3818 is a real image.

In the illustrated embodiment, a paired image 3824 is also used for comparison with the input image 3812. The input image 3812 may be derived from the image 3824, such as by downsampling the image 3824 to obtain a lower resolution input image 3812 (from 1024×1024 to 256×256 in the illustrated example).

The synthetic image 3816 and image 3824 may be compared to obtain a level 2 (L2) direct spatial loss 3824 that is a function of difference values obtained by subtracting pixel values in image 3816 from pixel values at the same pixel position in the image 3824. The L2 spatial loss 3824 may be a function of these difference values, such as a sum, sum of absolute values of the difference values, average, RMS, standard deviation, or other characterization of the difference values.

The synthetic image 3816 and image 3824 may be input to the discriminator 3810 which outputs perceptual loss 3826. The perceptual loss 3826 may be obtained by processing the synthetic image 3816 with the discriminator 3810 and processing the image 3824. First outputs of the stages of the discriminator 3410 following processing of the synthetic image 3816 may compared to their corresponding second outputs of the stages of the discriminator 3810 following processing of the image 3824. Stated differently, the intermediate values that are output by one stage and input to another stage are compared for the images 3816, 3824.

The result of the comparison may be a set of difference values, one difference value for each value of each output of each stage for the images 3816, 3824. For example, the output of each stage may be a two, three, or greater, dimensional matrix. Each difference value may be obtained by subtracting each value the matrix output from each stage for one image 3816 from the same matrix output (same indexes in the two, three, or more dimensions) of the same stage for the other image 3824. Note that not all values output from all stage need be compared, but for each value that is compared, the values compared will correspond to the same point within the discriminator 3810.

This set of difference values may then be processed to obtain the perceptual loss 3826. This may include summing, summing absolute values of the difference values, calculating a RMS, weighting and summing, calculating a statistical characterization of the difference values (maximum, minimum, standard deviation, etc.), or some other value derived from the difference values.

The loss function for a given iteration of a training algorithm may therefore: increase with differences between the synthetic image 3816 and the image 3824; increase with a number of values in the realism matrix 3820 that correctly identified the synthetic image 3416 as being a fake image; and increase with increase in the perceptual loss 3826. The training algorithm will therefore process training data entries that each include an input image 3812, and its corresponding masks 3814 and real image 3824 using the generator 3802 and discriminators 3808, 3810 as described above and evaluate the loss function. The training algorithm will adjust parameters of the generator 3802 in order to reduce the loss function. The loss function of the discriminator 3808 may increase with increase in a number of values in the realism matrix 3820 that identify the synthetic image 3816 as real. The training algorithm may adjust the parameters of the discriminator 3808 to reduce the loss function of the discriminator 3808. As noted above, the discriminator 3810 may be pretrained such that it is not changed during training of the generator 3802 and the discriminator 3808.

During utilization, an input image 3812 and input masks 3814 are processed using the generator 3802 to produce a synthetic image 3816 with higher resolution. The input images 3812 and corresponding masks 3814 and real image 3824 used for training may be obtained by using real images 3824 that are downsampled to obtain the input image 3812 and with the masks 3814 being labeled by licensed dentists.

Because the synthetic image generator 3802 may be sensitive to training parameters and architecture, a validation set of training entries (images 3812, masks 3814, and real image 3824) may be used for hyperparameter testing and a final hold out test set of training data entries may be used to assess final model performance prior to deployment.

In at least one possible embodiment, the illustrated system 3800 a may be implemented with respect to three-dimensional input images 3812, masks 3814, and real images 3824 such as a CT. In such embodiments, two dimensional (e.g., 4×4 and 1×1 convolutional kernels) may be replaced with three dimensional kernels (e.g., 4×4×4 convolutional kernels and 1×1×1 convolutional kernels).

FIG. 38B illustrates a system 3800 b that is modified relative to the system 3800 a with elements designated by a number having the same configuration as the element with that number in the description of FIG. 38A, above. The system 3800 b may be used to obtain a synthetic image 3816 based on an input image 3812, the synthetic image 3816 having the same resolution of the input image 3812 but being sharpened, denoised, restored or otherwise improved relative to the input image 3812.

In the illustrated embodiment, the generator 3802 is replaced with a generator 3802 b including an encoder 3804 b and a decoder 3806 b. The stages of the encoder 3804 b and decoder 3806 b may be configured the same as the stages of the generator 3804 except that they are different in size and number. For example, the input image 3812 may already be a high resolution image (e.g., 1024×1024 instead of 256×256) such that the dimensions of the stages of the encoder 3804 b and decoder 3806 b are larger. The image may also be contaminated with noise such as gaussian noise, salt and pepper noise, contrast, shadowing noise, or learned noise with a separate machine learning model. The image may also be blurred with gaussian smoothing kernel or motion blur. In the illustrated embodiment, the dimensions of the input stage of the encoder 3804 b and the dimensions of the output of the output stage of the decoder 3806 b are the same. In the illustrated embodiment, the encoder 3804 b includes six multi-scale stages each configured as described above for the stages of the encoder 3804 other than with respect to dimensions of inputs and outputs to each stage. The decoder 3806 b includes five multi-scale stages each configured as described above for the stages of the decoder 3806 other than with respect to dimensions of inputs and outputs for each stage. The masks 3814 for the input image 3812 may be combined with the output of each stage of the decoder 3806 b and the combination may be used as the input to the next stage of the decoder 3806 b using the approach described above with respect to FIGS. 34 and 35.

Training data entries for the system 3800 b may include in input image 3812, masks 3814 for the input image, and a real image 3824, the input image 3812 being a degraded version of the real image 3824. The input image 3812 may be obtained by blurring portions of the real image 3824, distorting one or more features of the real image 3824, adding random noise to the real image 3824, or applying some other transformation

Training the system 3800 b may be performed in the same manner as described above with respect to the system 3800 a. As a result of comparing the L2 loss 3822, the generator 3802 b will be trained to recreate a sharper version of a given input image 3812, with the discriminators 3808 and 3810 imposing a realism constraint.

Utilization of the system 3800 b may be performed in the same manner as for the system 3800 a with an input image 3812 and its corresponding masks 3814 being processed using the generator 3802 b with the output of the generator 3802 b being a synthetic image 3816 that has been sharpened according to training of the generator 3802 b.

Referring to FIG. 39A, orthodontic treatment may be planned with reference to various orthodontic points on the patient. These orthodontic points may be used to plan tooth movement, widening of the maxilla or mandible, maxillary surgery or movement, mandibular surgery or movement, or other orthodontic movements or surgeries. Examples of orthodontic points that may be identified are described below with respect to FIGS. 39B and 39C.

The illustrated system 3900 may be used to automatically identify orthodontic points. The system 3900 may include a generator 3902 including an encoder portion 3904 and a decoder portion 3906. The generator 3902 may be configured according to any of the generators described herein above, including the configuration of stages of the encoder and decoder 3904, 3906, convolutional kernels, rectifier units, or any other attribute of the generators according to the embodiments disclosed hereinabove. The system 3900 may further include a discriminator 3908. The discriminator 3908 may be configured in a same manner as any of the discriminators according to any of the embodiments disclosed herein above.

The generator 3902 may take as inputs an image 3910, such as a two- or three-dimensional image according to any of the imaging modalities described herein. The generator 3902 may further take as inputs masks 3912 of teeth, masks 3914 of dental anatomy, and masks 3916 of restorations. The image 3910 may be concatenated with these masks 3912, 3914, 3916 and the result of the concatenation processed using the generator 3902. These masks 3912, 3914, 3916 may be labels of pixels of the input image 3910 corresponding to the feature labeled by the mask. There may be a mask for each tooth number, each type of anatomy, and each restoration that is labeled. The anatomy and restorations labeled may include any of the anatomy and restorations described as being labeled in any of the foregoing embodiments.

In some embodiments, the generator 3902 may further take as inputs a style matrix 3918 and/or geography matrix 3920. The matrixes 3918, 3920 may be generated and input to the generator 3902 using the approach described above with respect to the style matrix and geography matrix described above with respect to some or all of FIGS. 21 through 25. As described above, the style matrix 3918 and geography matrix 3920 may account for variation in labeling, which, in the embodiment of FIG. 39A, will include variation in labeling of orthodontic points for various individuals and locations.

The output of the generator 3902 may be a set of predicted orthodontic points 3922. To facilitate training, the orthodontic points 3922 as output from the generator 3902 may be dilated, e.g., each orthodontic point may be represented as a 2D (circle or rectangle) or 3D region (sphere or cuboid) in which the generator 3902 estimates the actual orthodontic point of the patient to lie. The amount of dilation (length of edges of rectangle or cuboid or diameter of circle or sphere) may be between 0.1 and 3 mm, though other amounts of dilation may also be used. The region may be defined as a probability distribution (e.g., Gaussian) defining an estimated probability that an actual orthodontic point is at any particular point within the region.

Each training data entry or a set of training data entries may include an image 3910 and data describing the features shown in the image, including masks 3912, 3914, 3916, style matrix 3918, geography matrix 3920, and target orthodontic points 3924. The target orthodontic points may be dilated or represented as 2D or 3D coordinates without dilation. During training, the predicted orthodontic points 3922 obtained for a training data entry may be compared to the target orthodontic points 3924 for the training data entry to obtain a level 1 (L1) loss 3926. The training algorithm may then update parameters of the generator 3902 according to the L1 loss 3926. In instances where the predicted orthodontic points 3922 are dilated and the target orthodontic points 3924 are not, the contribution to L1 loss 3926 due to an individual dilated point 3922 and corresponding target point 3924 may be any of (a) 0 provided the target point 3924 lies within the region defined by the dilated point 3922, (b) 0 if the target point 3924 lies on a center of the dilated point 3922 and increasing with distance of the target point 3924 from the center of the dilated point 3922, or (c) a function of a probability value of a probability distribution defined for the point 3922 such that the loss increases and as the value of the probability distribution at the location of the target point 3924 decreases.

The predicted orthodontic points 3922 may also be input to the discriminator 3908 along with unpaired real orthodontic points 3928 (labeled orthodontic points for an image of a different patient than the image 3910 used to generate the predicted orthodontic points 3922). The output of the discriminator 3908 may be in the form of a realism matrix 3930 in which each value of the matrix 3930 is an estimate of which of the sets of orthodontic points 3922, 3928 is real and which is fake.

The training algorithm may evaluate the realism matrix 3930 output for a given training data entry in addition to L1 loss in order to update the parameters of the generator 3902. In this manner, the generator 3902 is trained to generate realistic orthodontic points. The training algorithm may further update the discriminator 3908 according to the realism matrix in order to train the discriminator 3908 to distinguish between real and fake orthodontic points.

During utilization, the discriminator 3908 may be ignored and an image 3910 and its corresponding masks 3912, 3914, 3916, style matrix 3918, and geography matrix 3920 may be processed using the generator 3902 to obtain predicted orthodontic points that may then be used to determine a course of orthodontic treatment, such as according to the methods described below. The inputs during utilization may correspond to those used during training. Accordingly, where any particular masks 3912, 3914, 3916, style matrix 3918, or geography matrix was omitted during training, it may also be omitted during utilization.

FIG. 39B illustrates orthodontic points 3932 a-3932 h that may be identified for each tooth number. Accordingly, the predicted orthodontic points 3922 and target orthodontic points 3924 may include values for each point 3932 a-3932 h on each tooth number of the patient. Using the orthodontic points 3932 a-3932 h, distances between them may be estimated. For example, the distance 3936 a between point 3932 b on tooth 3934 a and point 3932 a on tooth 3934 b. In another example, distance 3936 b between a point 3932 d and a point 3932 f (a point on the CEJ) of the same tooth may be calculated. In yet another example, a distance 3936 c between a root tip 3932 h and a point 3932 f on the CEJ may be calculated. These examples are non-limiting, distances between any pair of orthodontic points may be calculated.

Other examples of orthodontic points may include anatomical points of the face and jaw in addition to teeth. These points may include the following points as commonly understood in the field of orthodontics:

-   -   The A point (A)     -   Anterior Nasal Spine (ANS)     -   B point (B)     -   Basion (Ba)     -   Gonion (Go)     -   Gnathion (Gn)     -   Lower Incisor Root Apex (L1)     -   Lower Lip (LL)     -   Lower Incisor Tip (L1I)     -   Menton (Me)     -   Nasion (N)     -   Orbitale (O)     -   Protuberance Menti (Pm)     -   Porion (Po)     -   Pogonion (Pog)     -   Pt point (Pt)     -   Prognathion (Prox)     -   Sella (S)     -   Subnasale (SN)     -   Soft Tissue Glabella (ST G)     -   Soft Tissue Menton (ST M)     -   Soft Tissue Pogonion (ST Pog)     -   Temporal Mandibular Joint Point (TMJ)     -   Upper Lip (UL)     -   Xi point     -   Tooth Apices     -   Crown of the Tooth     -   Height of Contour     -   Furcation     -   Anterior Dental Arch Length     -   Anterior Dental Arch Width     -   Posterior Dental Arch Width     -   Intermolar Width     -   Molar Width     -   Tooth Size     -   Canine Depth     -   Canine Width     -   Intercanine Width     -   Occlusal Point

FIG. 40 illustrates a system 4000 that may be used to measure the distance between two orthodontic points, such as a pair of orthodontic points identified using the approach described above with respect to FIG. 39A or as labeled by a human.

The system 4000 may include an encoder 4002 (also referable to as classifier), such as an encoder according to any of the embodiments disclosed herein above with the final layer of the encoder 4002 being a fully connected layer. The encoder 4002 may take as inputs an input image 4004 and masks labeling features represented in the input image 4004, such as tooth masks 4006, anatomy masks 4008, and restoration masks 4010. The image 4004 may be a 2D or 3D image according to any of the imaging modalities described herein. The masks 4006, 4008, 4010 may be defined and generated according to masks described above with respect to any of the foregoing embodiments. The encoder 4002 may further take as an input an orthodontic point pair 4012. The orthodontic point pair 4012 may be any pair of points identified according to the approach of FIG. 39A and may be input in the form of two pairs of 3D coordinates, such as coordinates in the form of millimeters relative to a 3D reference point.

The encoder 4002 may be trained to output a distance 4014 between the pair of orthodontic points 4012, such as a distance in millimeters or some other unit. Accordingly, a training algorithm may train the encoder 4002 by processing a plurality of training data entries, each training data entry including an input image 4004, masks 4006, 4008, 4010 of features represented in the input image 4004, and a pair of orthodontic points 4012 as inputs and a labeled distance as a desired output. The labeled distance may be input by a licensed orthodontist or other human labeler. The training algorithm may therefore process the inputs of each training data entry, obtain an L1 loss as a difference between the distance 4014 and the labeled distance. The training algorithm may then adjust the parameters of the encoder 4002 according to the L1 loss for each training data entry.

During utilization, an input image 4004, masks 4006, 4008, 4010 of features represented in the input image 4004, and a pair of orthodontic points 4012 may be processed using the encoder 4002 to obtain a distance 4014 that may then be used in subsequent processes for determining a course of orthodontic treatment or for other purposes, such as according to any of the methods described hereinbelow.

FIG. 41 illustrates a system 4100 that may be used to assess a risk of an orthodontic treatment. In particular, for a given set of orthodontic points, certain movements and surgeries may pose a risk of exacerbating or creating certain pathologies. Examples of pathologies include the non-limiting examples of periodontitis, risk of endodontic lesions, risk of fracture, risk of caries, risk of defects.

The system 4100 may include an encoder 4102 (also referable to as classifier), such as an encoder according to any of the embodiments disclosed herein above with the final layer of the encoder 4102 being a fully connected layer. The encoder 4102 may take as inputs an input image 4104 and masks labeling features represented in the input image 4104, such as tooth masks 4106, anatomy masks 4108, and restoration masks 4110. The image 4104 may be a 2D or 3D image according to any of the imaging modalities described herein. The masks 4106, 4108, 4110 may be defined and generated according to masks described above with respect to any of the foregoing embodiments. The encoder 4102 may further take as an input a set of orthodontic points 4112. The orthodontic points 4112 may be a set of points identified using the approach of FIG. 39A and may be input in the form of 3D coordinates, such as coordinates in the form of millimeters relative to a 3D reference point. The orthodontic points may also be obtained by a human labeler analyzing the input image 4104.

The encoder 4102 may be trained to output an estimated pathology vector 4114, each value in the estimated pathology vector corresponding to a pathology of a set of pathologies and indicating a risk of orthodontic treatment worsening or causing that pathology. For example, the values may be according to a hyperbolic tangent loss function ranging from −1 (no risk) to 1 (high risk). Accordingly, a training algorithm may train the encoder 4102 by processing a plurality of training data entries, each training data entry including an input image 4104, masks 4106, 4108, 4110 of features represented in the input image 4104, and a set of orthodontic points 4112 as inputs. The desired output of each training data entry may include a target pathology vector, each value of the vector corresponding to a pathology and having a value according to the hyperbolic tangent function as determined by a licensed orthodontic professional, the value indicating a risk of that pathology being caused or worsened by orthodontic treatment.

The encoder 4102 may be trained for a particular orthodontic treatment, such that the target pathology vector corresponds to risk from that particular orthodontic treatment. Accordingly, there may be encoders 4102 each trained for one of a plurality of orthodontic treatments.

The training algorithm may process the inputs of each training data entry, obtain an L1 loss as a difference between the estimated pathology vector 4114 and the target pathology vector for the training data entry. The difference may be a root mean square (RMS) difference, cosine error, or other means for measuring the difference between two vectors. The training algorithm may then adjust the parameters of the encoder 4102 according to the L1 loss for each training data entry.

During utilization, an input image 4104, masks 4106, 4108, 4110 of features represented in the input image 4104, and a pair of orthodontic points 4112 may be processed using the encoder 4102 to obtain an estimated pathology vector that may then be used to determine whether orthodontic treatment is treatment, such as the specific orthodontic treatment for which the encoder 4102 was trained.

Referring to FIG. 42A, planning orthodontic treatment may include generating a deformation field for the various orthodontic points of the patient. The deformation field may define directions and amount of movement for one or more of the orthodontic points of the patient in order to a desired outcome. An example deformation is shown in FIG. 42B.

The illustrated system 4200 may be used to automatically identify a deformation field for orthodontic points. The system 4200 may include a generator 4202 including an encoder portion 4204 and a decoder portion 4206. The generator 4202 may be configured according to any of the generators described herein above, including the configuration of stages of the encoder and decoder 4204, 4206, convolutional kernels, rectifier units, or any other attribute of the generators according to the embodiments disclosed hereinabove. The system 4200 may further include a discriminator 4208. The discriminator 4208 may be configured in a same manner as any of the discriminators according to any of the embodiments disclosed herein above.

The generator 4202 may take as inputs an image 4210, such as a two- or three-dimensional image according to any of the imaging modalities described herein. The generator 4202 may further take as inputs masks 4212 of teeth, masks 4214 of dental anatomy, and masks 4216 of restorations. These masks 4212, 4214, 4216 may be labels of pixels of the input image 4210 corresponding to the feature labeled by the mask. There may be a mask for each tooth number, each type of anatomy, and each restoration that is labeled. The anatomy and restorations labeled may include any of the anatomy and restorations described as being labeled in any of the foregoing embodiments. The generator 4202 may further take as inputs a set of orthodontic points 4218, such as a set of orthodontic points generated using the approach of FIG. 39A. The image 4210 may be concatenated with these masks 4212, 4214, 4216 and the set of orthodontic points 4218 and the result of the concatenation processed using the generator 4202.

In some embodiments, the generator 4202 may further take as inputs a style matrix 4220 and/or geography matrix 4222. The matrixes 4220, 4222 may be generated and input to the generator 4202 using the approach described above with respect to the style matrix and geography matrix described above with respect to some or all of FIGS. 21 through 25. As described above, the style matrix 4220 and geography matrix 4222 may account for variation in labeling, which, in the embodiment of FIG. 42A, will include variation in labeling of orthodontic points for various individuals and locations.

The output of the generator 4202 may be a predicted deformation vector field 4224. In particular, the deformation vector field 4224 may include a set of vectors, each vector corresponding to one of the orthodontic points and defining a 2D or 3D vector indicting a degree of relative movement to that orthodontic point by means of an orthodontic treatment. Dimensions of the vector may be in millimeters or some other unit of length.

Each training data entry or a set of training data entries may include an image 4210 and data describing the features shown in the image, including masks 4212, 4214, 4216, orthodontic points 4218, style matrix 4220, geography matrix 4222, and a target deformation vector field 4226. During training, the predicted deformation vector field 4224 obtained for a training data entry may be compared to the target deformation vector field 4226 for the training data entry to obtain a level 1 (L1) loss 4228. The L1 loss may be computed as RMS, cosine error, or other measure of difference between the predicted deformation vector field 4224 and target deformation field 4226. The training algorithm may then update parameters of the generator 4202 according to the L1 loss 4226.

The predicted deformation vector field 4224 may be input to the discriminator 4208 along with an unpaired deformation vector field 4230 (labeled deformation vector field for an image of a different patient than the image 4210 used to generate the predicted deformation vector field 4224). The output of the discriminator 4208 may be in the form of a realism matrix 4232 in which each value of the matrix 4230 is an estimate of which of the deformation vector fields 4224, 4230 is real and which is fake.

The training algorithm may evaluate the realism matrix 4232 output for a given training data entry in addition to L1 loss in order to update the parameters of the generator 4202 such that the generator 4202 is trained to generate realistic deformation vector fields. The training algorithm may further update the discriminator 4208 according to the realism matrix in order to train the discriminator 4208 to distinguish between real and fake orthodontic points.

During utilization, the discriminator 4208 may be ignored and an image 4210 and its corresponding masks 4212, 4214, 4216, orthodontic points 4218, style matrix 4220, and geography matrix 4222 may be processed using the generator 4202 to obtain a predicted deformation field 4224 that may then be used to determine a course of orthodontic treatment, such as according to the methods described below. The inputs during utilization may correspond to those used during training. Accordingly, where any particular masks 4212, 4214, 4216, style matrix 4220, or geography matrix 4222 was omitted during training, it may also be omitted during utilization.

FIG. 42B illustrates an example of a deformation vector field. the deformation vector field may be defined with respect to orthodontic points 4234. The deformation vector field may include vectors 4236, each vector 4236 defining movement of an orthodontic point 4234 relative to an original location of the orthodontic point 4234. The orthodontic points 4234 may be points on teeth 4238, bone 4240, or other anatomy. The orthodontic points 4234 may include any of the orthodontic points defined hereinabove.

FIG. 43 illustrates a system 4300 that may be used to determine an appropriate degree of movement between a pair of orthodontic points, such as orthodontic points identified according to the approach of FIG. 39A. The method 4300 may operate with respect to orthodontic points in pairs such that the location of each point in the pair is known and the distance between the points is known, such as using the approach described above with respect to FIG. 40.

The system 4300 may include an encoder 4302 (also referable to as classifier), such as an encoder according to any of the embodiments disclosed herein above with the final layer of the encoder 4302 being a fully connected layer. The encoder 4302 may take as inputs an input image 4304 and masks labeling features represented in the input image 4304, such as tooth masks 4306, anatomy masks 4308, and restoration masks 4310. The image 4304 may be a 2D or 3D image according to any of the imaging modalities described herein. The masks 4306, 4308, 4310 may be defined and generated according to masks described above with respect to any of the foregoing embodiments. The encoder 4302 may further take as an input a pair of orthodontic points 4312 identified within the input image 4304. The orthodontic points may be a pair of points identified using the approach of FIG. 39A. The orthodontic points 4312 may also be obtained by a human labeler analyzing the input image 4304. The orthodontic points may be in the form of 2D or 3D coordinates.

In some embodiment, inputs to the encoder 4302 may further include a point type 4314 and/or a point distance. The point type 4314 indicates the anatomy referenced by one or both points of the pair of orthodontic points 4312 and may be in the form of a numerical code indicating the type of one or both of the orthodontic points. The point distance 4316 may represent the distance between the points of the pair of orthodontic points, such as in millimeters or other units of length. The point distance 4316 may be a distance as determined using the approach of FIG. 40. In the illustrated embodiment, the point type 4314 and point distance 4316 are concatenated with an output of the penultimate stage of the encoder 4302 and the result of the concatenation is input to the last stage of the encoder 4302, which is a fully connected layer in the illustrated embodiment.

The encoder 4302 may be trained to output an estimated point-specific deformation vector field 4318. The estimated deformation vector field 4318 may be as defined above with respect to FIGS. 42A and 42B except that it is defined for only one or both points of the pair of orthodontic points. Accordingly, a user may input a pair of specific orthodontic points into the encoder 4302 in order to obtain an estimated deformation vector field 4318 for moving the anatomy on which one or both points of the pair of orthodontic points lie.

A training algorithm may train the encoder 4302 by processing a plurality of training data entries, each training data entry including an input image 4304, masks 4306, 4308, 4310 of features represented in the input image 4304, a pair of orthodontic points 4312, point type 4314, and point distance 4316 as inputs. The desired output of each training data entry may include target deformation vector field defining a vector for one or both points of the pair of orthodontic points and indicating a direction and amount of movement for one or both points of the pair of orthodontic points. The one or more vectors of the deformation vector field may be two- or three-element vectors defining movement in two or three dimensions.

The training algorithm may process the inputs of each training data entry, obtain an L1 loss as a difference between the estimated deformation vector field 4318 and the target deformation vector field for the training data entry. The difference may be a root mean square (RMS) difference, cosine error, or other means for measuring the difference between two vectors. The training algorithm may then adjust the parameters of the encoder 4302 according to the L1 loss for each training data entry.

During utilization, an input image 4304, masks 4306, 4308, 4310 of features represented in the input image 4304, a pair of orthodontic points 4312, type 4314 of the pair of orthodontic points, and point distance 4316 of the pair of orthodontic points may be processed using the encoder 4302 to obtain an estimated deformation vector field 4318 that may then be used to determine an orthodontic treatment.

FIG. 44 illustrates a system 4400 that may be used to determine aspects of orthodontic treatment including some or all of mandibular surgery or movement, maxillary surgery or movement, bracket placement, retainer placement and configuration, or application placement and configuration.

The system 4400 may include an encoder 4402 (also referable to as classifier), such as an encoder according to any of the embodiments disclosed herein above with the final layer of the encoder 4402 being a fully connected layer. The encoder 4402 may take as inputs an input image 4404 and masks labeling features represented in the input image 4404, such as tooth masks 4406, anatomy masks 4408, and restoration masks 4410. The image 4404 may be a 2D or 3D image according to any of the imaging modalities described herein. The masks 4406, 4408, 4410 may be defined and generated according to masks described above with respect to any of the foregoing embodiments.

The encoder 4402 may further take as an input a set of orthodontic points 4412 identified within the input image 4404. The orthodontic points may be some or all points identified using the approach of FIG. 39A. The orthodontic points 4412 may also be obtained by a human labeler analyzing the input image 4404. The orthodontic points may be in the form of 2D or 3D coordinates.

In some embodiment, inputs to the encoder 4402 may further include a point deformation vector field 4414 and/or a set of point distances 4416. The deformation vector field 4414 may be a deformation vector field generated using the approach of FIG. 42A. The set of point distances 4416 may be point distances generated using the approach of FIG. 40. In the illustrated embodiment, the deformation vector field 4414 and set of point distances 4416 are concatenated with an output of the penultimate stage of the encoder 4402 and the result of the concatenation is input to the last stage of the encoder 4402, which is a fully connected layer in the illustrated embodiment.

The encoder 4402 may be trained to output an estimated treatment plan 4418, the estimated treatment plan including data defining some or all of mandibular surgery or movement, maxillary surgery or movement, bracket placement, retainer placement and configuration, or application placement and configuration. In the case of bracket placement, retainer configuration and placement, and application configuration and placement, the treatment plan 4418 may include a point cloud. A point cloud for bracket placement may include a set of two, three, or more coordinates (2D or 3D coordinates) for each bracket that is sufficient to define the position and orientation of a bracket. For a retainer or appliance, a point cloud may define a set of coordinates defining the position of points along a wire, plastic, or other material defining the retainer or appliance. For surgery, the point cloud may define coordinates defining breaks in bone, removal of bone, or locations of other actions to be performed as part of the surgery.

A training algorithm may train the encoder 4402 by processing a plurality of training data entries, each training data entry including an input image 4404, masks 4406, 4408, 4410 of features represented in the input image 4404, a set of orthodontic points 4412, deformation vector field 4414, and point distances 4416 as inputs. The desired output of each training data entry may include target treatment plan having the same format as the estimated treatment plan 4418 (e.g., coordinates defining treatments as described above).

The training algorithm may process the inputs of each training data entry, obtain an L1 loss as a difference between the estimated treatment plan 4418 and the target treatment plan for the training data entry. The difference may be a root mean square (RMS) difference, cosine error, or other means for measuring the difference between the coordinates of the estimated treatment plan 4418 and the target treatment plan. The training algorithm may then adjust the parameters of the encoder 4402 according to the L1 loss for each training data entry.

During utilization, an input image 4404, masks 4406, 4408, 4410 of features represented in the input image 4404, a set of orthodontic points 4412, deformation vector field 4414, and point distances 4416 may be processed using the encoder 4402 to obtain an estimated treatment plan 4418.

Referring to FIG. 45, a typical dental practice will record patient information in forms both for record keeping purposes and for purposes of submitting a claim to an insurance provider. FIG. 45 illustrates a section 4500 of an American Dental Association (ADA) claim form. The section 4208 illustrates fields that may be filled in when requesting reimbursement for a dental procedure. As is apparent, these fields include an area of oral cavity, tooth system, identifying tooth number or letters, tooth surface, a procedure code indicating treatment provided or to proposed, a text description that may include text describing the condition to be treated and/or the treatment provided, and a fee charged for the performed or proposed treatment.

Automatic extraction of information from an image of a form may include, for each field of a plurality of fields of the forms identifying such information as the locations 4502 of corners of the field, a printed column label 4504 for the field, a text blob 4506 encircling text written (by hand or printed by a device) within the field.

The systems and methods described hereinbelow provide an approach for identification of fields of a dental form and extraction of information from each field to obtain an attribute-value pair, the attribute corresponding to the type of value represented by the field and the value corresponding to characters contained within the field.

Referring to FIG. 46, a reference image 4600 may include an image of a form free of distortion, rotation, missing areas, or other defects. The reference image 4600 may include labels 4602 of references points indicating the location of features of the form, such as one or more corners of one or more fields or other features of the form. The reference image 4600 may be processed along with an input image 4604 that is an image of a form that may be distorted, rotated, have missing areas, or other defects.

The reference image 4600 and the input image 4604 may be processed by a segmentation network 4606. The output of the segmentation network 4606 may be labels 4608 of reference points labeling points on the input image 4604 corresponding to the reference point labels 4602 in the reference image.

For example, the segmentation network 4606 may be an encoder-decoder CNN that may be configured according to any of the embodiments disclosed herein. The encoder-decoder may be trained with training data entries that include a training image as an input and labeled reference points as desired outputs. For example, the output of the encoder-decoder may include a plurality of output channels, each output channel being an array of outputs equal in size to the size of the training image (N×M output bits for an N×M pixel image). Each output channel may be segmentation mask with the non-zero pixels in each mask corresponding to pixels of the input image being a label 4608 corresponding to one of the reference point labels 4602. The desired output for each training data entry may therefore include a set of training segmentation masks that each label the location of pixels in the training image corresponding to one of the reference point labels 4602.

The segmentation network may be trained by processing the training image of a training data entry to obtain a set of segmentation masks and evaluating a cost function that increases with differences between each segmentation mask output by the encoder-decoder for a given reference point and the segmentation mask for that reference point in the training data entry. A training algorithm may then update the parameters of the encoder-decoder in order to train the encoder-decoder to output accurate segmentation masks for a given input image.

The segmentation masks may be processed to obtain offset vectors 4610 for each reference point, each offset vector 4610 defining a transformation of a label 4608 for a reference point in order to reverse rotation, distortion, or other defects affecting the location of the label 4068. Accordingly, the combined set of vectors 4610 may define a vector field that may be sufficient to transform the input image 4604 such that each field is closer to the expected location of that field in the reference image 4600. The input image 4604 may be transformed according to the vector field and data extracted from each field using the expected location of each field according to the reference image 4600.

FIG. 47 illustrates a system 4700 that may be used to obtain the vectors 4610. The system may include encoders 4702, 4704. The encoders 4702, 4704 may be CNNs configured as encoders, such as according to any of the embodiments disclosed herein.

The outputs of the last stage of the encoders 4702, 4704 may be input to a single fully connected layer 4706, the output of the fully connected layer 4706 being estimated vectors 4610. The vectors 4610 may be in the form of an x and y offset (e.g., horizontal and vertical offset within the image 4604) and a flag (“Exists”) that indicates whether the reference point corresponding to a vector 4610 was found in the input image 4604. In some embodiments, the offset may additionally or alternatively include a distance, such as calculated according to Sqrt((x₀−x_(p)){circumflex over ( )}2+(y₀−y_(p)){circumflex over ( )}2), where x₀ and y₀ are locations (in pixel coordinates) of a reference point label 4602 in the reference image 4600 and x_(p) and y_(p) are locations (in pixel coordinates) of a feature corresponding to the reference point label 4602 in the input image 4600.

The inputs to the encoder 4702 may be the reference image and labels 4602 of the reference points, such as in the form of segmentation masks as described above, each segmentation mask corresponding to one of the reference point labels 4602. These inputs may be concatenated prior to input to the encoder 4702.

The inputs to the encoder 4704 may include an input image 4604 (either for training or utilization) and labels 4608 of points in the input image 4604 corresponding to the reference point labels 4602, such as in the form of segmentation masks obtained as described above, each segmentation masks corresponding to one of the reference point labels 4602.

The output of each encoder 4702, 4704 may be an array of values that encode the labels 4602, 4608 and information from the images 4600, 4604, respectively. These arrays of values are concatenated and input to the fully connected layer 4610 to obtain the offsets 4610.

The reference image 4600 and labels 4602 may be static for all training data entries such that each training data entry includes an input image 4604 that may be rotated, distorted, or have some other defect and labels 4608 as inputs and training offsets for the input image 4604 as desired outputs, the training offsets being labeled by a human labeler.

Training may include, for each training data entry of a plurality of training data entries, processing the reference image 4600 and reference labels 4602 and the input image 4608 and labels 4608 of a training data image using the system 4700 to obtain offsets 4610 and evaluating a loss function that increases with differences between the offsets 4610 and the training offsets. The parameters of the encoders 4702, 4704, and fully connected layer 4610 may then be updated according to the loss function in order to train the system 4700 to give the correct offsets for a given input image 4604 with respect to a reference image 4600.

In some instances, a single form is used. Accordingly, during utilization, the outputs of the encoder 4702 will not change and may be input to the fully connected layer 4706 for each utilization without repeating processing according to the encoder 4702. In other use cases, multiple forms are used such that different input images 4600 and reference point labels 4602 may be input during training and utilization.

FIG. 48 illustrates a system 4800 for extracting a text blob from a field of a form. The system 4800 may include an encoder-decoder including an encoder 4802 with the output of the encoder 4802 being input to a decoder 4804. The encoder-decoder may include CNNs according to any of the embodiments disclosed herein. The system 4800 may further include a discriminator 4806, such as a discriminator according to any of the embodiments disclosed herein.

The encoder 4802 may receive an input 4808, such as a portion of an image of a form. The portion may be identified from an input image 4604 using reference labels 4608 identified as described above. The portion may be reoriented, distorted, or otherwise transformed according to the offsets in order to at least partially reverse rotation, distortion, or other defect. For example, the reference labels 4608 may be corners of a field, an original portion of the image may be a portion of the image within a quadrilateral shape defined by the corners of the field and the portion may be obtained by transforming the original portion such that the corners of the portion define a rectangular shape with sides parallel to the x (horizontal) and y (vertical) axes of an corrected version of the form represented in the image 4604 and the pixels within the portion obtained by transforming the original portion to reverse rotation, distortion, and/or other defects.

In some instances, a text blob intended to be written to a field may spread into an adjacent field. Accordingly, the input 4808 may be an expanded portion of the input image 4604 corresponding to a field labeled by labels 4608 and a region of surrounding the labels 4608, e.g. a 10 to 100 pixel region, or other sized region. The expanded portion may likewise by transformed to correct for rotation, distortion, and/or other defects.

In some instances, the input 4808 may be the entire input image 4604 concatenated with a segmentation mask labeling pixels corresponding to a field marked by the labels 4608 for an individual field, e.g. a filled quadrilateral shape with corners at the locations marked by the labels 4608 for an individual field.

In some embodiments, the input 4808 may be the entire input image 4604 concatenated with the labels 4608 (which may be segmentation masks as described above) and the offsets 4610 corresponding to the labels 4608 as described above.

The encoder-decoder may be trained with multiple types of forms. In such embodiments, a version type 4810, e.g. a numerical code associated with each type of dental form, may be concatenated with an output of an intermediate stage of the encoder-decoder to obtain a concatenated output and the concatenated output may be input to a next stage of the encoder-decoder following the intermediate stage. In the illustrated embodiment, the intermediate stage is a last stage of the encoder 4802.

The output of the decoder 4804 may be a synthetic text blob 4812. For example, the output 4812 may be an image having the same dimensions from the input 4808 and having non-zero pixels at locations estimated to belong to a blob of pixels completely containing the text represented by the form indicated by the portion 4808, such as a portion labeled by the labels 4608 for an individual field.

The synthetic text blob 4812 may be input to the discriminator 4806 along with an unpaired synthetic text blob 4814 having the same image dimensions. The text blob 4208 may be unpaired in the sense that it is from a different image of a different copy of the form with different written or printed values. The text blob 4208 may also be from a same or different field of the form than that represented in the input 4808.

The synthetic blob 4812 and unpaired blob 4814 may be processed with the discriminator 4806 to obtain a realism estimate 4816 indicating which of the blobs 4812, 4814 is estimated to be real and/or which is synthetic. The realism estimate 4816 may be in the form of a realism matrix, each value in the matrix being an estimate of which of the blobs 4812, 4814 is real.

The synthetic blob 4812 may be compared to a target text blob 4818. For example, each training data entry may include an input 4808 according to any of the alternatives described above, which may include a version type 4810, as an input and a target text blob 4818 as a desired output, the target text blob 4818 may be generated by a human labeler marking the outline of text corresponding to the field labeled by the reference points 4608 of the input 4808. A result of the comparison may be an L1 loss 4814 that increases with difference between the synthetic blob 4812 and the target blob 4818.

Each training data entry of a plurality of training data entries may be processed using the encoder-decoder and the discriminator 4806 to obtain a synthetic text blob 4812, L1 loss 4814, and realism estimate 4816. For each training data entry, parameters of the encoder-decoder may be updated according to the L1 loss 4814 and the realism estimate 4816 such that the encoder-decoder is trained to both output the correct synthetic blob 4812 and have properties of a human-labeled synthetic blob. Parameters of the discriminator 4816 may likewise be updated to train the discriminator 4816 to correctly identify artificially created blobs 4812.

During utilization, the discriminator 4806 may be discarded or ignored and the synthetic blob 4812 may be obtained by processing an input 4808 according to any of the alternatives described above using the encoder-decoder.

FIG. 49A illustrates a system 4900 a for extracting text from an image, particularly text relating to dental diagnosis and treatment as may be recorded in a dental form. The system 4900 a may take as inputs an input 4808 and a text blob 4812. The input 4808 may be any of the alternatives described above with respect to FIG. 48 for the input 4808. The text blob 4812 may be a text blob 4812 as described above with respect to FIG. 48 and may be obtained from the input 4808 either manually or using the approach of FIG. 48. The output of the system 4900 a may be a string 4902 of characters (letters, numbers, symbols, etc.) estimated to be depicted in the region of the input 4808 marked by the text blob 4812.

The system 4900 a may be a CNN, such as a CNN embodied as an encoder according to any of the embodiments disclosed herein. In the illustrated embodiment, the CNN includes seven multi-scale stages 4904 followed by one or more fully connected layers 4906, 4908, the last fully connected layer producing the output string 4902.

Each multi-scale stage 4904 may contain three 3×3 convolutional layers that may be paired with batchnormalization and leaky rectified linear units (LeakyReLU). The first and last convolutional layers of a stage 4904 may be concatenated via residual connections which help reduce redundancy within the network by propagating shallow information to deeper parts of the network.

Each multi-scale stage 4904 may be downscaled by a factor of two at the end of each multi-scale stage 4904, such as by max pooling. The third and fifth multi-scale stages 4904 may be passed through attention gates 4910 a, 4910 b, respectively, before being concatenated with the output of the last stage 4904. For example, the gating signal of attention gate 4910 a that is applied to the output of the third stage 4904 may be derived from the fifth stage 4904 and the gating signal applied by attention gate 4910 b to the output of the fifth stage 4904 may be derived from the seventh stage 4904. Not all regions of the image are relevant for classification, so attention gates 4910 a, 4910 b may be used to selectively propagate semantically meaningful information to deeper parts of the network. In the illustrated embodiment, the output of the first fully connected layer 4906 is input to a second fully connected layer 4908 that outputs the string 4902.

Each training data entry may include an input 4808, text blob 4812 and labeled text, such as received from a human labeler reading the text from which the text blob 4812 was generated. Using a text blob 4812 rather than the input image 4808 may facilitate training of the system 4900 a inasmuch as the region of interest has already been identified. A loss function may therefore be calculated such that the loss function increases with difference between the string 4902 and the labeled text. This difference may be represented as string edit distance, Jaccard index, or other measure of similarity between strings of text. The training algorithm may update parameters of the system 4900 a according to the loss function in order to train the system 4900 a to extract text from a given input 4808 and a text blob 4812 for the input 4808.

FIG. 49B illustrates a system 4900 b that may have the same configuration a the system 4900 a described above except as indicated below. In the system 4900 b, a first fully connected layer 4906 produces an output that is input to a first LSTM 4912. The output of the first LSTM 4912 may be input to a second LSTM 4914. The output of the LSTM 4914 is then used as the string 4902 that is an estimate of the text represented in the input 4808 and contained within the text blob 4812. During training, parameters of the LSTMs 4912, 4914 may be updated along with those of the stages 4904 and fully connected layer 4906 according to the loss function for each training data entry processed.

In some embodiments, additional information describing the text represented by the text blob 4812 may be input between one or more components of the system 4900 b. In the illustrated embodiment, the additional information is concatenated with an output of the last stage 4904 and the result of concatenation is input to the fully connected layer 4906. The additional information may include a numerical encoding information such as a category 4916 of information represented by the text blob 4812, such as an address, date, fee, area, of oral cavity, or any label of any field of a form (see, e.g., FIG. 45). The additional information may include a numerical code encoding a type 4918 of the text represented by the text blob 4812, e.g. typed text, hand-printed text, cursive text, or other information. Where the additional information is used, each training data may include as inputs an input 4808 according to any of the alternatives described above, text blob 4812, and one or more items of additional information 4916, 4918 as inputs and a target text string as the desired output.

The training algorithm may therefore process the inputs using the system 4900 b as described above to obtain a string 4902. The loss function may be calculated as a difference between the string 4902 and the target text string. The parameters of the system 4900 b may be updated by a training algorithm according to the loss function in order to train the system 4900 b to output the correct string 4902 for a given input 4808, text blob 4812, and additional information 4916, 4918.

Referring to FIG. 50, the illustrated system 5000 may be used to interpret a plurality of fields of a dental form, such as area of oral cavity, surface, tooth system, procedure code, fee, and/or other fields of a dental form. For example, each field in a row of a form for a given proposed or administered treatment may be processed using the illustrated system 5000. For example, for each field of a dental form, a system may be trained to process inputs 4808 and text blobs 4812 corresponding to that field. For example, the system for each field may include a CNN 5002, LSTM 5004, and LSTM 5006, the output of the CNN 5002 being input to an LSTM 5004, the output of the LSTM 5004 being input to the LSTM 5006, and the output of the LSTM 5006 being a text string 5008. The system for each field may be a system 4900 a or system 4900 b as described above. The system for each field may be identically trained or may be trained using training data including only inputs 4808 and text blobs 4212 corresponding to that field.

In some embodiments, one or more intermediate outputs of the system for each field may be concatenated and input to a machine learning model 5010, such as a CNN, a single fully connected layer, or other type of neural network. In the illustrated embodiments, the outputs of each CNN 5002 and each LSTM 5004 are concatenated and input to the machine learning model 5010 to obtain an estimated procedure code 5012. The machine learning model 5010 may be trained to output a procedure code from a limited set of predefined procedure codes used to designate dental treatments for which a dentist may claim reimbursement.

As is apparent in FIG. 50, there may be a system dedicated to interpreting the text included in the procedure code field. The machine learning model 5010 may be used in combination with or instead of this system. For example, the system for the procedure code field may be limited to text interpretation of images of the procedure code field whereas the machine learning model 5010 takes into account other information derived from other fields in addition to the procedure code field and therefore provides a more reliable estimate of the procedure code.

Training of the system for each field (CNN 5002, LSTM 5004, LSTM 5006) may be performed separately, such as using the approach described above with respect to the system 4900 a or 4900 b. Following training, the machine learning model 5010 may be trained using the same or different training data. For example, each training data entry may include a set of inputs 4808 and text blobs 4812 for a plurality of fields of a dental form and a target procedure code as a desired output. For each training data entry, the training algorithm may process the inputs 4808 and text blobs 4812 for each field using the system 5000 to obtain an estimated procedure code 5012. The loss function may be zero when the estimated and target procedure codes match and otherwise be non-zero. The training algorithm may adjust parameters of the machine learning model 5010 according to the loss function to train the machine learning model 5010 to output the correct procedure code. The parameters for the systems for each field may be maintained static during this process or trained simultaneously with training of the machine learning model 5010.

Referring to FIG. 51, the output of the LSTM 5006 (which may be the LSTM 4914 of a system 4900 b) may be in the form of a two dimensional array of probabilities, each column 5102 corresponding to one character position in a string and each row position in each column 5102 including a probability 5104, the probability 5104 indicating a probability that a character (number, letter, symbol) corresponding to that row position is present at that character position in the string. Accordingly, within each column 5102 the character corresponding to the row with the highest probability 5104 may be selected as the character most likely to be correct for that string position, i.e., be represented in an image of text processed according to the approaches described above.

The loss function for a given system for a text field may therefore be a function of these probabilities such that the loss function decreases with increase in the probabilities for the correct character at each string position and increases with increase in the probabilities for incorrect characters at each string position.

The array of probabilities may be used in various ways in order to determine a final string for a given field of a form processed according to the approaches described hereinabove.

Referring to FIG. 52, in some embodiments, the array of probabilities obtained for one or more fields may be processed by a fully connected layer 5200 or other machine learning model 5200. In some embodiments, the inputs to the fully connected layer 5200 is strings of characters as opposed to an array of probabilities as described with respect to FIG. 51. In some embodiments, the input to the fully connected layer 5200 is a string of characters and probabilities for each character in the string of characters, the character at each character position in the string being the character with the highest probability for that character position in the array of probabilities. The probability associated with each string position may be the probability of the selected character in the array of probabilities.

The fully connected layer 5200 may be trained with a closed set of values. In the illustrated example, the fully connected layer 5200 is trained to output some or all of the license number (NPI #), state, and name of a dental provider that is found in a database, such as the national provider identifier (NPI) database. For example, each training data entry of a plurality of training data entries may include (a) inputs including data (array of probabilities, string, or string and probability for each character position in the string) obtained for one or more fields of a dental form according to any of the approaches described above and (b) correct data corresponding to the one or more fields of the dental form from the database as a desired output. The training data entries may be the result of human interpretation of the dental form used to generate each training data entry.

During training, the inputs of each training data entry may be processed using the fully connected layer 5200 to obtain estimated data. A loss function may be evaluated that increases with difference between the estimated data and the correct data for each training data entry (e.g., string edit distance, Jaccard index, or other metric). The training algorithm may then adjust the parameters of the fully connected layer 5200 according to the loss function in order to train the fully connected layer 5200 to output correct data for a given input array of probabilities. Training may be performed using a plurality of training data entries having the correct data thereof corresponding to all of the entries of the database, such as the NPI database. Accordingly, the fully connected layer 5200 may be retrained as additional entries are added to the database. Multiple training data entries may be provided for each entry in the database, such as from multiple forms submitted by an individual provider represented in the NPI database.

In some embodiments, the fully connected layer 5200 may be trained to output the correct data for a given array of probabilities for one or more fields of one or more different forms 5202. For example, the fields may be different, arranged in different orders, or provide a different combination of items of information. Accordingly, the training data entries may include a string of characters, array of probabilities, or a string and associated probabilities for each character position for fields of multiple types of forms.

FIG. 53 illustrates an alternative system 5300 for resolving a string extracted from a form to an entry in a database. In the illustrated example, this may include text obtained from fields including some or all of name, address (street, state, zip code, etc.), and license number for a dental provider being mapped to an entry in a provider database, such as the NPI database.

In the illustrated example, data 5302 from one or more fields may be restructured to obtain restructured data 5304. For example, data from multiple fields may be arranged in a single array of characters input as a single layer to a machine learning model.

In the illustrated embodiment, the machine learning model may be an ensemble network 5306 including one or more machine learning models that each process the restructured data 5304 and the outputs of which may be combined to obtain an estimated output.

For example, the ensemble network 5306 may include one path including a first fully connected layer 5308 that receives the restructured data 5304 and a second fully connected layer 5310 that receives the output of the first fully connected layer 5308 and outputs a prediction, i.e. an identifier of a database entry corresponding to the restructured data 5304, such as a license number of a practitioner in the NPI database. Any number of fully connected layers may be arranged in series, such as three or more.

The ensemble network 5306 may include another path including a first LSTMs 5312 that receives the restructured data 5304. The output of the first LSTM 5312 may receive the output of the first LSTM 5312 and output a prediction, i.e. an identifier of a database entry corresponding to the restructured data 5304, such as a license number of a practitioner in the NPI database. Any number of LSTMs may be arranged in series, such as three or more.

There may be one or more other paths that may be similarly or differently configured, such as including other machine learning models such as a CNN implementing an encoder.

Predictions from the two or more paths of the ensemble network 5308 may be combined to obtain a final prediction 5316. Combination may include selecting one of the predictions from the different paths of the ensemble network 5308. Combination may be used according to any approach known in the art for combining predictions of paths of an ensemble network. For example, each path may output a prediction as well as a confidence value. The prediction with the highest confidence value may be selected as the output of the ensemble network 5308. In other implementations, the predictions are input to a final machine learning model trained to select between the outputs of the paths.

Each path of the ensemble network 5308 may be trained separately. For example, training data entries may include, as an input, restructured data obtained from a form or a database entry corresponding to a provider license number, e.g. a name, address, license number, clinic name, or other data. The restructured data in a training data may be intentionally corrupted such as by transposing characters, replacing individual characters or groups of characters with alternative letters or groups of letters that are visually similar, deleting letters or groups of letters, or performing other modifications. Each training data entry may include a correct provider license number as a desired output. Inasmuch as the ensemble network 5308 may be required to identify any provider in a database, one or more training data entries may be provided for each entry in the database, such as a version with uncorrupted input data and zero or more other entries with corrupted input data.

Each path may be trained by processing the input of each training data entry to obtain a prediction. The prediction and correct provider license number may be compared according to a loss function to obtain a loss that increases with differences between the prediction and the corrected provider license number. Parameters of the path may then be updated by a training algorithm according to the loss such that the path is trained to output the correct provider license number for a given input to the path.

FIGS. 51-53 illustrate just a few examples of how information extracted from a dental form may be used. In another example, information extracted from a form may be combined with data extracted from one or more dental images (radiograph, FMX, etc.). For example, images may inadvertently be mirrored due to a transparent radiograph being scanned from the wrong side. Accordingly, a given image in the anatomical sequence may be part of a “mirror pair” that shall be understood as a first anatomical sequence from the left side of a patient and a second anatomical sequence from a right side of a patient that could be confused with one another if mirrored, for example: Left Premolar 2 and right Premolar 2, Left Molar3 and Right Molar 3.

Ambiguity in laterality may be resolved using the following method:

-   -   1. Classify each image of the one or more dental images         according to anatomy shown (e.g., anatomic sequence in an FMX as         described above with respect to FIG. 4).     -   2. Extract, from the dental form, dental anatomy information         including some or all of area of oral cavity, tooth system,         tooth number, and tooth surface.     -   3. If the dental anatomy information corresponds to one side of         the patient and only one image in a mirror pair corresponds to         the dental anatomy information (e.g., depicting the area of oral         cavity, tooth system, and/or tooth number) and if the one image         does not match the laterality indicated by the dental anatomy         information, take a remedial action.     -   4. If the dental anatomy information corresponds to one side of         the patient and both images in a mirror pair are provided with         one image of the pair corresponding to the dental anatomy         information (e.g., depicting the area of oral cavity, tooth         system, and/or tooth number), refrain from taking remedial         action.

Remedial actions may include denying a claim requested by the dental form and generating a message indicating a potential error in the information submitted in support of the claim. Alternatively, an alert may be generated and transmitted to an administrator or a source of the form indicating that the claim is supported by potentially erroneous information. A remedial action may also include flipping the image to match the data recorded in the dental form.

Another method may include:

-   -   1. Classify each image of the one or more dental images         according to anatomy shown (e.g., anatomic sequence in an FMX as         described above with respect to FIG. 4).     -   2. Extract, from the dental form, dental anatomy information         including some or all of area of oral cavity, tooth system,         tooth number, and tooth surface.     -   3. If the dental anatomy information corresponds to one side of         the patient and the dental images include both images of a         mirror pair are received with one of the images of the mirror         pair corresponding to the dental anatomy:         -   a. Identify features in the one or more dental images, such             as carious lesions or restorations, and the tooth number             and/or tooth surface on which the feature is present (see,             e.g. the approach described above with respect to some or             all of FIGS. 23-27)         -   b. Compare the identified features to the dental anatomy             information.         -   c. If the identified features have a laterally swapped             relationship to the dental information, take remedial             action. “Laterally swapped” may mean a mirrored translation             of the dental anatomy information results in correspondence             to the identified features (e.g., tooth number 8 (top right             incisor) translated to tooth number 9 (top left incisor,             tooth number 5 (top right bicuspid) translated to tooth             number 14 (top left bicuspid).

Data extracted from a dental form according to any of the approaches described above may also be used to handle any of the following situations:

-   -   1. An incorrect image modality such as a panoramic or intra-oral         image may be accidentally associated with a procedure specified         in a dental form instead of a bitewing X-ray.     -   2. The tooth or oral area associated with the proposed procedure         in the dental form might not be present or might not be fully         visible on the associated dental image.     -   3. A form specifying a procedure should be accompanied by an         image captured at a certain time point that shows the tooth or         oral area of interest before, during, or after the treatment.         The wrong time point might be associated with the procedure for         the tooth or oral area of interest.     -   4. The wrong patient images might be associated with the         procedure specified in the dental form.     -   5. Images that have been previously used on an earlier date for         a different or same patient might be incorrectly associated with         the procedure and patient of interest specified in the dental         form.

Referring to FIG. 54, the illustrated interface 5400 may be presented to a user and receive inputs from a user in order to create a workflow 5402. The workflow 5402 may include an input patient treatment data block 5404, one or more decision blocks 5406, and one or more output blocks 5408.

The patient treatment data block 5404 may represent data to be processed according to the workflow and may therefore have associated therewith images of dental anatomy according to any of the imaging modalities described herein. The images of dental anatomy may include multiple views of a patient, such as a FMX and may include images captured during one visit or from multiple visits distributed over months or years.

The patient treatment data block 5404 may be associated with patient demographic data (age, gender), a listing of comorbidities, a listing of past dental treatments, or other data.

The patient treatment data block 5404 may be associated with one or more measurements of dental anatomy or pathologies represented in the image data, including automatically generated measurements of dental anatomy, pathologies, or other dental conditions, according to any of the embodiments disclosed herein.

The patient treatment data block 5404 may be associated with a listing of one or more treatments either performed after capturing of the most recent image data associated with the patient treatment data block 5404 or proposed to be performed based on pathologies represented in the most recent image data. Treatments may be represented in the form of treatment name and location information such as one or more tooth numbers, one or more surface labels for the one or more tooth numbers, a quadrant of the patient's mount, or other identifier of dental anatomy to receive the treatment.

The data associated with patient treatment data block 5404 may be represented in a structured way enabling automated processing according to the blocks 5406, 5408 of the workflow 5402. Although the patient treatment data block 5404 is shown as the first block in the workflow 5402, any of the blocks of the workflow 5402 may operate with respect to data associated with the patient treatment data block 5404.

The patient treatment data block 5404 may be placed by the user and its graphical representation may have elements that are selectable by a user to modify data associated with the block 5404 or to associate other data with the block 5404, in the form of input text, image files, structured data files, or other data.

Decision blocks 5408 and output blocks 5408 may be placed by a user by selecting a block type 5410 from a block menu 5412 and selecting a location to place a block 5406, 5408 of that type on the interface 5400 (i.e., an instance of that block type). The user may then input data further configuring each block 5406, 5408 and specify connections between blocks 5406, 5408 and the patient treatment data block 5404. A connection between blocks 5406, 5408 may specify an ordering of evaluation of each block 5406, 5408 and a dependency of a block 5406, 5408 on processing performed by a previous block. The patient treatment data block 5404 may be presumed to be the starting point of a workflow. Each decision block 5406 may have a positive (Y) and negative (N) output that may then be connected to another block 5406, 5408. A second block 5406, 5408 connected to the positive output of a first decision block 5406 is executed if the result of the processing of the first decision block 5406 is positive, otherwise a third block 5406, 5408 connected to the negative output of the first decision block 5406 is executed.

Each decision block 5406 may include one or more if statements 5414. Each if statement 5414 may operate with respect to one or more items of data associated with the patient treatment data block 5404. There may be multiple if statements 5414 in each decision block 5406 and the multiple if statements 5414 may be related to one another by a Boolean operator 5416. For example, supposing there are if statements A and B, then the Boolean operator 5146 may specify the positive output if (A AND B) is true, if (A OR B) is true, if (A XOR B) is true, or any other Boolean expression incorporating the results of A and B. Where three or more if statements 5414 are included, any Boolean expression operating on the results of these if statements 5414 may be used as the Boolean operator 5416. Where the result of applying the Boolean operator 51416 to the results of the if statements 51414 is negative, the result of the decision block 5406 may be the negative output.

Each output block 5408 is processed if the output (positive, negative) of the decision block 5406 to which it is connected is produced. Each output block 5408 may include a decision statement 5418 that is either a coded or human-understandable statement specifying the result of the workflow if that output block 5408 is reached. For example, the decision statement 5418 may indicate that an administered or proposed treatment is suitable based on the data associated with the patient treatment data block. The decision statement 5418 may state that an administered or proposed treatment is not deemed appropriate. The output block 5408 may include internal text 5420 viewable to an enterprise executing the workflow but not viewable to an entity submitting the data associated with the patient treatment data block 5404 for evaluation according to the workflow 5402. The output block 5408 may also include external text 5422 that is viewable by this entity. The internal and external text 5420, 5422 may provide a human-readable explanation for the decision statement 5418.

As is apparent in FIG. 54, a workflow may include multiple output blocks 5408. The positive output of a decision block 5406 may be connected to one output block 5408 whereas the negative output of the same decision block 5406 is connected to another output block 5408. A single output block 5408 may be connected to outputs of one or multiple decision blocks 5406.

FIG. 55 illustrates an interface 5500 for creating block types 5410 for inclusion in the block menu 5412. The interface 5500 may include a block type selection element 5502. The block type selection element 5502 may enable a user to select to create a custom block type or to select from a set of predefined block types included by a provider of the interface 5500.

The interface 5500 may include a block name input element 5504 enabling a user to input a name for the block type created using the interface 5500. The interface 5500 may include a block description input element 5506 enabling a user to input text describing the purpose and/or function of a block type created using the interface 5500. In some embodiments, user interface elements may also be provided enabling a user to specify aspects of a visual representation of the block type, such as color, font, one or more images, or other visual feature or attribute.

The interface 5500 may include one or more logical statement generators 5508 or a single logical statement generator 5508 for generating one or more if statements 5414 for a decision block 5406 using the interface 5500. The logical statement generator 5508 may include a category selection element 5510 enabling a user to select from a list or directory of categories. For example, some categories may be a measurement of dental anatomy or pathology obtained according to any of the systems and methods described herein. Other categories may include a location (tooth number, quadrant, portion of a tooth, etc.). Each category may also be a diagnosis or other characterization of dental anatomy or pathology according to any of the systems and methods described herein.

In some embodiments, creating an instance of a block type referencing a category will associate therewith a machine learning model for obtaining that category of information from the data associated with the patient treatment data block 5404. Where multiple instances of a block types use the same information, the same instance of the machine learning model may be shared between them. Processing of a block that uses information obtained from the machine learning model may invoke processing of patient data to obtain data derived from the patient data using the machine learning model.

The logical statement generator 5508 may include a value selection element 5512 enabling a user to select or input a value or range of values for the category selected using the category selection element 5510. For example, for a given category, there may be a range of permitted or reasonable values or a discrete set of possible values for that category. Accordingly, the value selection element 5512 may display possible values and provide an interface for receiving user selection of a value or range of values.

The logical statement generator 5508 may include a logic selection element 5514. The logic selection element 5514 may enable a user to input logic to be applied to the value or range of values specified using the value selection element 5512 (“selected value”) with respect to the value for the selected category in the data associated with the patient treatment data block 5404 (“actual value”). For example, the logic that is used to determine whether the condition of an if statement has been met may include:

-   -   the condition of the if statement is met if an actual value         equal to the selected value is “in” the data associated with the         patient treatment data block 5404. For example, if the selected         value is an extent of caries, the actual value may be specified         as being “in” if the caries are in anatomy specified as the         selected value (e.g., in the pulp of the affected tooth). In         another example, if a specified treatment is referenced in the         data associated with the patient treatment data block (at all or         in reference to a particular tooth), then the selected value         will be determined to be “in.”     -   the condition of the if statement is met if the actual value is         greater than the selected value.     -   the condition of the if statement is met if the actual value is         less than the selected value.     -   the condition of the if statement is met if the actual value is         equal to the selected value.

Note that the logic available for selection using the logic selection element 5514 may be dependent on the category selected. For example, some categories, such as caries extent, can only have values in or not in a specified portion of a tooth whereas other categories such as PD, CAL, or GM have numerical values that can be less than, greater than, or equal to a selected value.

Logic available for selection may enable combination of categories, e.g., the selection of a location (tooth number, quadrant, tooth surface, etc.) as well as a condition applied to a selected value corresponding to that location in the anatomy of the patient.

The interface 5500 may further include a Boolean expression input element 5516. The Boolean expression input element 5516 may receive inputs from the user specifying logical conjunctions (AND, OR, XOR, NAND, NOR) between the results (0 or 1) of if statements generated using the one or more logic statement generators 5508. More complex expressions including any of parentheses, inverting (NOT) of individual results or expressions based on one or more results may also be input to the Boolean expression input element 5516.

Output blocks 5408 may also be created using the interface 5500 responsive to inputs of the user specifying the block type to be an output block and receiving inputs from the user specifying the decision statement 5418, internal text 5420, and external text 5422.

Responsive to inputs to the interface 5500, a block type 5410 may be generated and made available in the block menu 5412 as described above with respect to FIG. 54. In some embodiments, one or more parameters of an instance of a block type may be modified responsive to inputs of the user through the interface 5400 after an instance 5406, 5408 of that block type has been created. These parameters may include some or all of those specified using the interface 5500.

FIG. 56 illustrates a method 5600 that may be used to create a block type using the interface 5500. The method 5600 may include receiving 5602 a block type label, e.g. input string, from the user. Step 5602 may further include receiving specifications for a color, font, image, or other visual attribute to be used when visually representing the block type. The method 5600 may include defining 5604 statements for the block type. This may include receiving inputs using the logical statement generator 5508 as described above. The method 5600 may further include defining 5606 a Boolean expression to be applied to the results of the statements from step 5604. As noted above, this may include receiving, from the user, a Boolean operator applied to pairs or a more complex Boolean expression operating on the results. A block type may then be added 5608 to the block menu 5412 according to the parameters specified at steps 5602-5606.

FIG. 57 illustrates a method 5700 for generating a workflow 5402 using blocks 5406, 5408 that are instances of block types, such as block types 5410 generated using the method 5600. Note that additional block types may be predefined by a provider of the interfaces 5400, 5500 such that some blocks 5406, 5408 are instances of these block types.

The method 5700 may include, responsive to inputs from the user, selecting 5702 a block type 5410 from the block menu 5412 and placing 5704 an instance of that block type at a location in a workflow in accordance with an input of the user, such as from a pointing device or touch screen. The method 5700 may further include connecting 5706 the input of the instance of that block type to either the patient treatment data block 5404 or one of the outputs (positive or negative) of another block. As noted above, where the category of information operated on by an instance of a decision block 5406 requires the use of a machine learning model, an instance of that machine learning model may be created automatically. Steps 5702-5706 may be repeated any number of times to create a desired workflow 5402 for determining appropriateness of a dental treatment.

Once a workflow 5414 is create according to the method 5700, it may be executed by a user by associating patient treatment data as described above with the patient treatment data block 5404 and instructing a computer system to execute the workflow 5402 with respect to the patient treatment data. As a result, the if statements 5414 of any decision blocks 5406 connected to the patient treatment data block 5404 are evaluated along with any Boolean expression 5416. The result (positive or negative) of the decision is used to determine which connected decision block 5406 or decision block 5408 to process next. If a connected block is a decision block 5406, it is evaluated in the same manner. This process continues for each connected decision block 5406 until all branches of the workflow 5402 have ended with a decision block 5408 or otherwise do not include any un-processed decision blocks 5406.

Below are examples of workflows 5402 that may be implemented using the interfaces 5400.

In a first example, a workflow 5402 is defined for evaluating whether root canal therapy (RCT) is appropriate for a tooth. Values and attributes referenced below shall be understood to be with reference to a particular tooth. Where the output for a decision block is “positive,” the block connected to the positive output will then be processed, otherwise, the block connected to the negative output will be processed. The workflow 5402 may be defined as follows:

-   -   Decision Block 1 (connected to patient treatment data block         5404): (if RCT is in=true) OR (if previous restoration type         “crown” is in=true), then output=positive.     -   Decision Block 2 (connected to positive output of Decision Block         1): if caries extent of “superficial” is in=true, then         output=positive.     -   Decision Block 3 (connected to negative output of Decision Block         1): (if caries extent of “pulp invasion” is in) OR (if decay         percent above CEJ is greater than 40) OR (if decay percent above         bone is greater than 40), then output=positive.     -   Decision Block 4 (connected to positive output of Decision Block         2): if visibility of “visible” is in, then output=positive.     -   Output Block 1 (connected to negative output of Decision Block         3): decision statement: deny as waste, external notes: need not         evident.     -   Decision Block 5 (connected to positive output of Decision Block         4): if crown height is greater than 2, then output=positive.     -   Output Block 2 (connected to negative output of Decision Block         4): decision statement: deny as waste, external notes: lack of         visibility.     -   Output Block 3 (connected to negative output of Decision         Block 2) decision statement: request more information, external         notes: lack of visibility.     -   Decision Block 6 (connected to positive output of Decision Block         5): if furcation bone distance is greater than 2,         output=positive.     -   Decision Block 7 (connected to positive output of Decision Block         6): if decay bone distance is greater than 0, output=positive.     -   Decision Block 8 (connected to negative output of Decision Block         6): if decay bone distance is greater than 2, output=positive.     -   Decision Block 9 (connected to positive outputs of Decision         Blocks 7 and 8): if crown root ratio is greater than 0.5,         output=positive.     -   Decision Block 10 (connected to positive output of Decision         Block 9): if crown ratio is less than 1.3, output=positive.     -   Output Block 4 (connected to positive output of Decision Block         10): decision statement: substantiated—D4341 approved, external         notes: allow.     -   Output Block 5 (connected to negative outputs of Decision Blocks         5, 7, 8, 9, and 10): decision statement: deny as waste, external         notes: poor prognosis.

In a second example, a workflow 5402 is defined for evaluating whether root scaling and planning is appropriate for a quadrant of a patient's mouth:

-   -   Decision Block 1 (connected to patient treatment data block         5404): if the number of teeth with CAL greater than 2.5 mm is         greater than 3 in a quadrant, output=positive.     -   Output Block 1 (connected to positive output of Decision Block         1): decision statement: substantiated and approved, external         notes: approved.     -   Decision Block 2 (connected to negative output of Decision Block         1): if the number of teeth with CAL greater than 2.5 is greater         than 0 in a quadrant, output=positive.     -   Output Block 2 (connected to positive output of Decision Block         2): decision statement: substantiated—provide alternative         benefit, external notes: provide alternative benefit D4342.     -   Output Block 3 (connected to negative output of Decision Block         2): decision statement: deny as waste, external notes: need not         evident.

Referring to FIGS. 58 to 60B, there are many different imaging devices used to capture dental images. Even for the same modality, there may be devices from different manufacturers or made at different times. Furthermore, variations in anatomy or image acquisition setup can modify perceived anatomical relationships in images. As a result, the real-world distance, area or volume represented by a pixel or voxel of an image may not be known. This real-world distance, area, or volume, hereinafter referred to as “pixel spacing,” may be used according to the approaches described above to accurately measure dental anatomy and pathologies.

Referring specifically to FIG. 58, multiple images of the same patient anatomy with different pixel spacings are not typically generated by dental practices. However, such images would be helpful to train a machine learning model to estimate the pixel spacing of images as described below with respect to FIG. 59. The system 5800 may be used to generate training images.

An original image 5802 has an original height and width measured in number of pixels (H1×W1). The original image 5802 has an original vertical pixel spacing h1 indicating the physical distance represented by the space between vertically adjacent pixels. The original image 5802 also has an original horizontal pixel spacing w1 indicating the physical distance represented by the space between horizontally adjacent pixels.

Some portions of the original image 5802 may be masked by text, missing image data in the corner regions as shown in FIG. 58, or by defects. The original image may be processed by an inpainting step 5804. For example, the approach described above with respect to FIG. 12 may be used to fill in masked portions of the original image 5802 to obtain a first inpainted image 5806. The first inpainted image 5806 may have the same size (H1×W1) and pixel spacing (h1, w1) as the original image 5802.

The first inpainted image 5806 may be processed according to a second inpainting step 5808 to obtain a second inpainted image 5812. The second inpainting step 5808 may be performed using the same machine learning model as for step 5804 or a different machine learning model. For example, the approach for training a machine learning model as described above with respect to FIG. 12 may be performed twice to obtain two machine learning modes. The first machine learning model may be used at step 5804 and be trained with training images including masking due to missing corners, obscuring text, or other defects. The second machine learning model may be used at step 5808 and be trained with training entries that each include a target image and a training image, the training image being a version of the target image with bands of pixels removed along some or all of the top, bottom, left, and right edges. In this manner the inpainting performed by the second machine learning model may be used to increase the size of an input image. When using the second machine learning model, the input image may be converted to a larger image 5810 including the input image surrounded by empty (white or black) pixels around the border and that are to be inpainted by the second machine learning model at step 5808. The second inpainted image 5812 may have a height (H2) and width (W2) such that one or both of the height and width are different than the height (H1) and width (W1), respectively, of the original image 5802. The pixel spacing of the second inpainted image 5812 may be identical (h1, w1) to that of the original image 5802.

Note that in some embodiments, the original image 5802 may be free of masking or defects such that the first inpainting step 5804 is not performed and the original image 5802 is used in place of the first inpainted image 5806 in the inpainting step 5808.

The second inpainted image 5812 may be further processed at step 5814 to generate a training image 5816 with a known height (H3), width (W3), vertical pixel spacing (h3), and horizontal pixel spacing (w3). The processing at step 5814 may include some or all of scaling, skewing, and masking the second inpainted image 5812 to obtain the training image 5816. Scaling may include converting the inpainted image 5812 into a smaller image such that one or both of H3 and W3 are smaller than H2 and W2 respectively. In particular, the inpainting step 5808 may be used to fill in information such that shrinking may be performed without leaving blank pixels around the edges training image 5816. Scaling may be performed using any downsampling approach known in the art of image processing. Skewing may include performing the downsampling in a non-uniform way and may include rotating the training image 5816 relative to the inpainted image. For example, rather than achieving a uniform pixel spacing (h3, w3), the pixel spacings h3 and 23 may each be a matrix of size H3×W3, with each value in the matrix indicating the size of a pixel in the training image 5816, e.g. h3(a,b) may indicate the vertical size of pixel T(a,b), where a and b are column and row indexes, respectively, and T is the matrix of pixel values constituting the training image 5816. Similarly, w3(a,b) may indicate the horizontal size of pixel T(a,b).

Masking performed at step 5814 may include masking pixels in the training image 5816 in correspondence with some or all of the maskings that may be typically found in an original image 5802 as described above (text, corner regions, defects, etc.).

An original image 5802 may also be used as a training image. In addition, an original image 5802 may be increased in resolution resulting in decreased pixel spacing in vertical and/or horizontal directions, such as using the approach of 38A and 38B. The original image 5802 or image with increased resolution may be further modified by any of scaling and skewing as described above.

Each training image maybe part of a training data entry that includes the training image as well as information regarding pixel spacing, either in the form of a single horizontal pixel spacing and a single vertical pixel spacing or matrices of pixel spacings such that each pixel, or a block of multiple pixels, has a corresponding element in the matrix listing the horizontal pixel spacing for each pixel or block of pixels and a corresponding element in the matrix listing the vertical pixel spacing for each pixel or block of pixels.

FIG. 59 illustrates a system 5900 that may be trained using training data entries including training images. The system 5900 may be trained to process input images to obtain estimated pixel spacings.

The system 5900 may take as an input an image 5902 or a section 5904 of an image. For example, the image 5902 may be trimmed to conform to a standard size (e.g., 256×256). Inpainting may be used to expand the visible anatomy of the image, resizing (downsampling or upsampling) of the inpainted image may then be used to change the pixel spacing of the image to obtain a scaled image. Following downsampling or upsampling, cropping of the scaled image may be used to obtain a standard size image. The standard size image obtained in this manner may cause the system 5900 to predict realistic anatomical deformations as opposed to just memorizing image artifacts created during synthetic image generation. If artifacts are introduced during synthetic image generation, then the system 5900 may just learn a correlation between the artifacts and the target pixel spacing matrix. Synthetically magnified images can be produced by cropping an image and upsampling the cropped image to the original size. However, minified images may be inpainted to represent a broader anatomical range otherwise there will be regions of the minified image with empty anatomy. Inpainting allows for broader anatomical visibility. The system 5900 may also be trained to predict non-rigid deformations.

The section 5904 may be processed using an encoder 5906, such as an encoder 5906 according to any of the embodiments disclosed herein. In the illustrated embodiment, the input stage of the encoder 5906 has dimensions equal to that of the section 5904 and the dimensions of the output stage of the encoder are 4×4, with one or multiple layers of those dimensions. The output of each multi-scale level of the encoder stage may also be input into a transformer consisting of a multihead self-attention and multilayer self-attention blocks. The transformer sub-network acts to enrich the propagation of information through skip connections and through the bottleneck formed at the base of the encoder network. The output of the transformer sub-network may be concatenated with the outputs of the encoder network. The output of the output stage of the encoder 5906 may be input to a transpose convolution stage 5908 that increases the dimensions such that the output of the transpose convolute stage 5908 has, for example, doubled dimensions (8×8 in the illustrated example).

The output of the transpose convolution stage 5908 may be a coarse horizontal spacing matrix 5910 and a coarse vertical spacing matrix 5912. Each value of each matrix 5910, 5912 represents an estimate of the pixel spacing for an array of pixels. For example, let hc(a,b) correspond to an element of the coarse horizontal spacing matrix 5910. Each value hc(a,b) may correspond to an estimated horizontal pixel spacing of pixels S(x,y), where:

-   -   S is the matrix of pixel values of the section 5904;     -   x is a value between n*b to n*b+n−1, where n is equal to a ratio         of W3 to the number of columns of the horizontal spacing matrix         5910; and     -   y is a value between m*a to m*a+m−1, where m is equal to a ratio         of H3 to the number of rows of the horizontal spacing matrix         5910.

In a like manner, let wc(a,b) correspond to an element of the coarse vertical spacing matrix 5912. Each value wc(a,b) corresponds to the estimated vertical pixel spacing of pixels S(x,y), where x and y may be the ranges of values specified above.

Some or all of the coarse horizontal spacing matrix 5910, course vertical spacing matrix 5912, one or more additional layers output by the encoder 5906, and the section 5904 may be processed in another transpose convolution layer 5914. The output of the transpose convolution layer 5914 may have the same dimensions as the section 5904 and may include one or more layers, such as a fine horizontal spacing matrix 5916 and a fine vertical spacing matrix. 5918. Each element of the matrix 5916 is an estimate of the horizontal pixel spacing at that same position in the section 5904, e.g. element hf(a,b) of matrix 5916 corresponds to the estimated pixel spacing of pixel S(a,b). Likewise, each element wf(a,b) of matrix 5918 corresponds to the estimated pixel spacing of pixel S(a,b).

For each matrix 5910, 5912, 5916, 5918, the training entry including the image 5902 may further include a corresponding target matrix: target coarse horizontal spacing matrix 5920, target coarse vertical spacing matrix 5922, target fine horizontal spacing matrix 5924, and target fine vertical spacing matrix 5926. The target matrices 5920, 5922, 5924, 5926 may be calculated using known values for the section 5904. In particular, the vertical and horizontal spacing of each pixel of each training image 5816 are determined by the scaling/skewing/masking step 5814 and are therefore known and may be used to derive the target matrices 5920, 5922, 5924, 5926 included in the training data entry including the training image 5816

The differences between matrix 5910 and matrix 5920 and the differences between matrix 5912 and matrix 5922 are combined (e.g., summed) to obtain a coarse deep supervision loss 5928. The differences between matrix 5916 and matrix 5924 and the differences between matrix 5918 and matrix 5926 are combined (e.g. summed) to obtain a fine loss 5930.

Both the coarse loss 5928 and fine loss 5930 obtained for each training data entry are used to update parameters of the encoder 5906, transpose convolution stage 5908, and transpose convolution stage 5914 in order to train them to more accurately estimate the pixel spacing of a given input image. During utilization, an input image is processed using the encoder 5906, transpose convolution stage 5908, and transpose convolution stage 5914 to obtain the fine estimated spacing matrices 5916, 5918. In some embodiments, the coarse estimated spacing matrices 5910, 5912 are ignored.

FIG. 60A illustrates a system 6000 a in which the pixel spacing estimation system 5900 may be used. As described above, patient data, including one or more input images 6004, may be processed by a machine learning model 6006 to obtain a dental measurement 6008, such as a measurement of dental anatomy (CAL, PD, crown-to-root ratio, crown height, root length, orthodontic landmark spacing, occlusion, tooth size, tooth width, etc.) or a dental pathology (e.g., carious lesion characteristics, bone loss, decay volume, periodontal disease, decay extent, endodontic lesion characteristics).

In some embodiments, accuracy of the dental measurement 6008 may be improved by additionally processing the input image 6004 with the pixel spacing estimation system 5900 to obtain the fine estimated spacing matrices 5924, 5926 for the input image 6004 and scaling 6010 the dental measurement 6008 to obtain a corrected measurement 6012. FIG. 60B illustrates an alternative system 6000 b for using the pixel spacing estimation system 5900. In this example, the input image 6004 is processed using the pixel spacing estimation model 5900. The input image 6004 is then corrected 6014 using the fine estimated spacing matrices 5924 to obtain a corrected image 6016. The patient data 6002 with the corrected image 6016 in place of the input image 6004 may then be processing using the machine learning model 6006 to obtain the corrected dental measurement 6008. The corrected dental measurement represents the true spatial distance between two or more anatomical points, area measurement, or volumetric measurement.

Referring to FIG. 61, 3D Anatomy projected onto a 2D image suffers from elongation, foreshortening, and other image deformations. Scaling 6010 as described above with respect to FIG. 60A may be used to correct elongation, foreshortening, and deformation caused by improper image acquisition setup, film placement, or anomalous anatomy. FIG. 61 illustrates a system 6100 that may be used to obtain a correct dental measurement obtained according to the approach of FIGS. 60A, 60B, or any of the approaches described herein for identifying or measuring dental features such as dental anatomy, pathologies, or treatments.

The system 61 may include a component performing a 3D-to-2D mapping 6102. The 3D-to-2D mapping 6102 may take as an input a volumetric grid 6104, such as a 3D image obtained from CBCT, MRI, or CT scan. The 3D-to-2D mapping 6102 may further take as an input a detector configuration 6106. The configuration 6106 may specify simulated locations for a X-ray source and film relative to the volumetric grid 6104. The 3D-to-2D mapping 6102 may then use a ray tracing algorithm, such as Siddon's Algorithm, to simulate perception of the anatomy represented by the volumetric grid 6104 to obtain a virtual 2D image 6108, which may be digitally reconstructed radiograph (DRR). The same volumetric grid 6104 may be perceived from a plurality of detector configures 6106 to obtain a plurality of virtual 2D images 6108. By tilting the film or angling the x-ray source, known image elongation, image foreshortening, and other image deformations can be generated for training purposes.

The virtual 2D images 6108 may be processed using a labelling model 6110. The labelling model 6110 may be a machine learning model trained to label a dental feature, such as an item of dental anatomy, pathology, or treatment according to any of the approaches described herein. As described above, such a model 6110 may take other information describing a patient, such as previously-labeled dental features as inputs. Accordingly, the virtual 2D image 6108 may be processed with this additional information. The labelling model 6110 may output, for each virtual 2D image 6108, one or more segmentation masks 6112, such as segmentation masks output according to any of the approaches for labeling dental features described hereinabove.

The segmentation mask 6112, and possibly the virtual 2D image 6108 used to obtain the mask 6112, may be processed using a 2D-to-3D estimation model 6114. The output of the 2d-to-3D estimation model 6114 may be a 3D estimate 6116 that compensates for artifacts resulting from the 3D-to-2D mapping. Virtual 2D images 6108 may be used to train the 2D-to-3D estimation model 6114 to perform this task.

For example, 3D estimate 6116 may be a non-linear pixel spacing correction for the pixels of the segmentation mask 6112 that may then be used to estimate distances between two points or a conglomeration of points. The predicted pixel spacing may be integrated with a line between two points to form a scaled/corrected anatomical distance relationship. The above method may be used to estimate 3D distances from 2D images and volumetric measurements from 2D images.

The 3D estimate 6116 may be compared to a 3D measurement from the volumetric grid 6104 used to generate the virtual 2D image. In particular, the actual pixel spacing of pixels in the virtual 2D image 6108 may be known from the volumetric grid 6104 and the known detector configuration 6106 used to generate the virtual 2D image 6108. Accordingly, this known measurement 6118 may be compared to the 3D estimate 6118, e.g., non-linear pixel spacing to obtain a loss 6120 that may be used by a training algorithm to train the 2D-to-3D estimation model 6114 to output correct 3D estimates 6116 for a given input image.

During utilization an input image may be processed using the labeling model 6110 to obtain a segmentation mask 6112. The segmentation mask 6112, and possibly the input image, may then be processed using the trained 2D-to-3D model 6114 to obtain a 3D estimate. The 3D estimate, e.g., non-linear pixel spacing estimate for pixels of the segmentation mask, may then be used to obtain a correct measurement of a dental feature labeled by the segmentation mask.

Note that the 2D-to-3D estimation model 6114 may be specific to a particular labeling model 6110 and trained exclusively with segmentation masks 6112 generated using that model 6110. Alternatively, the 2D-to-3D estimation model 6114 may be trained with segmentation masks 6112 generated by models 6110 trained to label various dental features such that multiple models 6110 may also be used during utilization. The 2D-to-3D estimation model 6114 may be implemented as a CNN, such as an encoder-decoder, classifier, or other type of machine learning model according to any of the embodiments disclosed herein.

FIG. 62 is a block diagram illustrating an example computing device 6200 which can be used to implement the system and methods disclosed herein. In some embodiments, a cluster of computing devices interconnected by a network may be used to implement any one or more components of the invention.

As described in detail above, some measurements of dental anatomy or pathologies are identified from an image along with other information, such as labels of teeth, caries, restorations, or other dental anatomy, pathologies, or treatments. Accordingly, in input image may be corrected as described in FIG. 60B and this corrected image may be used for processing by each of a series of machine learning models used to derive a dental measurement.

Computing device 6200 may be used to perform various procedures, such as those discussed herein. Computing device 6200 can function as a server, a client, or any other computing entity. Computing device can execute one or more application programs, such as the training algorithms and utilization of machine learning models described herein. Computing device 6200 can be any of a wide variety of computing devices, such as a desktop computer, a notebook computer, a server computer, a handheld computer, tablet computer and the like.

Computing device 6200 includes one or more processor(s) 6202, one or more memory device(s) 6204, one or more interface(s) 6206, one or more mass storage device(s) 6208, one or more Input/Output (I/O) device(s) 6210, and a display device 6230 all of which are coupled to a bus 6212. Processor(s) 6202 include one or more processors or controllers that execute instructions stored in memory device(s) 6204 and/or mass storage device(s) 6208. Processor(s) 6202 may also include various types of computer-readable media, such as cache memory.

Memory device(s) 6204 include various computer-readable media, such as volatile memory (e.g., random access memory (RAM) 6214) and/or nonvolatile memory (e.g., read-only memory (ROM) 6216). Memory device(s) 6204 may also include rewritable ROM, such as Flash memory.

Mass storage device(s) 6208 include various computer readable media, such as magnetic tapes, magnetic disks, optical disks, solid-state memory (e.g., Flash memory), and so forth. As shown in FIG. 62, a particular mass storage device is a hard disk drive 6224. Various drives may also be included in mass storage device(s) 6208 to enable reading from and/or writing to the various computer readable media. Mass storage device(s) 6208 include removable media 6226 and/or non-removable media.

I/O device(s) 6210 include various devices that allow data and/or other information to be input to or retrieved from computing device 6200. Example I/O device(s) 6210 include cursor control devices, keyboards, keypads, microphones, monitors or other display devices, speakers, printers, network interface cards, modems, lenses, CCDs or other image capture devices, and the like.

Display device 6230 includes any type of device capable of displaying information to one or more users of computing device 6200. Examples of display device 6230 include a monitor, display terminal, video projection device, and the like.

A graphics-processing unit (GPU) 6232 may be coupled to the processor(s) 6202 and/or to the display device 6230, such as by the bus 6212. The GPU 6232 may be operable to perform convolutions to implement a CNN according to any of the embodiments disclosed herein. The GPU 6232 may include some or all of the functionality of a general-purpose processor, such as the processor(s) 6202.

Interface(s) 6206 include various interfaces that allow computing device 6200 to interact with other systems, devices, or computing environments. Example interface(s) 6206 include any number of different network interfaces 6220, such as interfaces to local area networks (LANs), wide area networks (WANs), wireless networks, and the Internet. Other interface(s) include user interface 6218 and peripheral device interface 6222. The interface(s) 6206 may also include one or more user interface elements 6218. The interface(s) 6206 may also include one or more peripheral interfaces such as interfaces for printers, pointing devices (mice, track pad, etc.), keyboards, and the like.

Bus 6212 allows processor(s) 6202, memory device(s) 6204, interface(s) 6206, mass storage device(s) 6208, and I/O device(s) 6210 to communicate with one another, as well as other devices or components coupled to bus 6212. Bus 6212 represents one or more of several types of bus structures, such as a system bus, PCI bus, IEEE 1394 bus, USB bus, and so forth.

For purposes of illustration, programs and other executable program components are shown herein as discrete blocks, although it is understood that such programs and components may reside at various times in different storage components of computing device 6200, and are executed by processor(s) 6202. Alternatively, the systems and procedures described herein can be implemented in hardware, or a combination of hardware, software, and/or firmware. For example, one or more application specific integrated circuits (ASICs) can be programmed to carry out one or more of the systems and procedures described herein. 

1. A method comprising: generating a plurality of training data entries, each including a training image that is an image of dental anatomy, by, for each training data entry of at least a first portion plurality of training data entries: receiving, by a computer system, an original image having an original pixel spacing; processing, by the computer system, the original image in a first machine learning model to add additional visual information around one or more edges of the original image to obtain an intermediate image; downsampling, by the computer system, the original image to obtain the training image such that the training image has a training pixel spacing that is different from the original pixel spacing; and adding the training pixel spacing to each training data entry.
 2. The method of claim 1, wherein a second portion of the plurality of training data entries each include the original image and the original pixel spacing used to obtain one of the second portion of the plurality of training data entries.
 3. The method of claim 1, wherein processing the original image in the machine learning model to add the additional visual information around the one or more edges of the original image to obtain the intermediate image comprises inpainting, by the computer system, portions of the original image that are masking the dental anatomy to obtain a first inpainted image; and adding the additional visual information around the one or more edges of the first inpainted image to obtain the intermediate image.
 4. The method of claim 1, wherein downsampling the original image to obtain the training image further comprises, additionally transforming the original image to obtain the training image by: skewing the original image; and masking portions of the original image.
 5. The method of claim 1, further comprising: training a second machine learning model with the plurality of training data entries to output a pixel spacing estimating for an input image processed using the second machine learning model.
 6. The method of claim 5, wherein the second machine learning model includes a convolution neural network.
 7. The method of claim 5, wherein the second machine learning model comprises an encoder and two transpose convolution stages.
 8. The method of claim 1, wherein the original image is obtained by a modality selected from the group consisting of full mouth series X-rays (FMX), dental cone beam computed tomography (CBCT), cephalometric X-ray, intra-oral optical image, panoramic dental X-ray, dental magnetic resonance imaging (MRI) image, dental light detection and ranging (LIDAR) image.
 9. A method for training a machine learning model comprising: providing a plurality of training data entries, each including a training image and a target pixel spacing matrix, the target pixel spacing matrix corresponding to real-world distances represented by pixels of the training image; for each training data entry of the plurality of training data entries: processing the training image of each training data entry using the machine learning model to obtain an estimated pixel spacing matrix; and updating the machine learning model according to differences between the target pixel spacing matrix and the estimated pixel spacing matrix.
 10. The method of claim 9, wherein: the target pixel spacing matrix is a coarse target pixel spacing matrix; each training data entry of the plurality of training data entries further includes a fine target pixel spacing matrix that is larger than the coarse target pixel spacing matrix, the fine target pixel spacing matrix corresponding to the real-world distances represented by the pixels of the training image and having a higher resolution than the coarse target pixel spacing matrix; the machine learning model includes a first model portion and a second model portion; the method further comprises: processing the training image of each training data entry with the first model portion to obtain the estimated pixel spacing matrix; processing the estimated pixel spacing matrix with the second model portion to obtain a fine estimated pixel spacing matrix; and updating the first model portion and the second model portion according to the differences between the estimated pixel spacing matrix and the coarse target pixel spacing matrix and differences between the fine estimated pixel spacing matrix and the fine target pixel spacing matrix.
 11. The method of claim 10, wherein the first model portion includes an encoder followed by a first transpose convolution stage.
 12. The method of claim 11, wherein the second model portion is a second transpose convolution stage.
 13. The method of claim 9, wherein the training image of each training data entry is obtained by a modality selected from the group consisting of full mouth series X-rays (FMX), dental cone beam computed tomography (CBCT), cephalometric X-ray, intra-oral optical image, panoramic dental X-ray, dental magnetic resonance imaging (MRI) image, dental light detection and ranging (LIDAR) image.
 14. A method comprising: receiving a dental image; processing the dental image with a first machine learning model to obtain an estimated pixel spacing for the dental image; performing one of (a) or (b), wherein: (a) comprises: processing the dental image according to the estimated pixel spacing to obtain a corrected image; and processing the corrected image with a second machine learning model to obtain an output, the output being one of a measurement of dental anatomy, a measurement of a dental pathology, and a diagnosis of a dental condition; and (b) comprises: processing the dental image with a second machine learning model to obtain the output; and correcting the output according to the estimated pixel spacing to obtain a corrected output.
 15. The method of claim 14, wherein the output is the measurement of dental anatomy including any of: an estimate of gingival margin (GM); an estimate of cementum-enamel junction (CEJ); an estimate of bony points of a tooth; and an estimate of junctional epithelium (JE).
 16. The method of claim 14, wherein the output is the measurement of the dental pathology including any of: pocket depth; number of caries; and clinical attachment level (CAL).
 17. The method of claim 1, wherein the first machine learning model includes a convolution neural network.
 18. The method of claim 17, wherein the first machine learning model includes an encoder.
 19. The method of claim 18, wherein the first machine learning model includes a first transpose convolution stage following the encoder.
 20. The method of claim 19, wherein the first machine learning model includes a second transpose convolution stage following the first transpose convolution stage and having larger dimensions than the first transpose convolution stage. 